0% found this document useful (0 votes)

9 views44 pages

Session 33-34-38

Uploaded by

Srinivas Bathula

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PPTX, PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

9 views44 pages

Session 33-34-38

Uploaded by

Srinivas Bathula

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PPTX, PDF, TXT or read online on Scribd

You are on page 1/ 44

Department of CSE(H)

AUTOMATA THEORY AND FORMAL

LANGUAGES
22CS2215A
Topic:

RECURSIVELY ENUMERABLE
AND RECURSIVE LANGUAGE
Session – 33-34-38

CREATED BY K. VICTOR BABU

AIM OF THE SESSION
The aim of this session is to provide an understanding of recursively enumerable and recursive languages, the computation of
functions using Turing Machines, and the concept of combining multiple Turing Machines.

INSTRUCTIONAL OBJECTIVES

This Session is designed to:

•To define and differentiate recursively enumerable and recursive languages.
•To explain how Turing Machines can be used to compute functions and solve computational problems.
•To demonstrate the process of combining multiple Turing Machines to perform complex computations.

LEARNING OUTCOMES

At the end of this session, you should be able to:

1. Differentiate between recursively enumerable and recursive languages.
2. Analyze the computational complexity of functions and evaluate their computability using Turing Machines.
3. Design and implement a combined Turing Machine to solve a given computational problem.

CREATED BY K. VICTOR BABU

Recursively Enumerable
and
Recursive Languages

A. Senthil - Professor/CSE 3
CREATED BY K. VICTOR BABU
Definition:
A language is recursively enumerable
if some Turing machine accepts it

A. Senthil - Professor/CSE 4
CREATED BY K. VICTOR BABU
Let L be a recursively enumerable language
and M the Turing Machine that accepts it

For string w:
if w L then M halts in a final state

if w L then M halts in a non-final state

or loops forever
5
CREATED BY K. VICTOR BABU
Definition:
A language is recursive
if some Turing machine accepts it
and halts on any input string

In other words:
A language is recursive if there is
a membership algorithm for it
A. Senthil - 6
CREATED BY K. VICTOR BABU
Let L be a recursive language
and M the Turing Machine that accepts it

For string w:

if w L then M halts in a final state

if w L then M halts in a non-final state

A. Senthil - 7
CREATED BY K. VICTOR BABU
Computing Functions
with
Turing Machines

A. Senthil - Professor/CSE 8
CREATED BY K. VICTOR BABU
A function f (w) has:

Domain: D Result Region: S

f (w)
w D f ( w)  S

A. Senthil - Professor/CSE 9
CREATED BY K. VICTOR BABU
A function may have many parameters:

Example: Addition function

f ( x, y )  x  y

A. Senthil - Professor/CSE 10
CREATED BY K. VICTOR BABU
Integer Domain

Decimal: 5

Binary: 101

Unary: 11111

We prefer unary representation:

easier to manipulate with Turing machines

A. Senthil - Professor/CSE 11
CREATED BY K. VICTOR BABU
Definition:

A function f is computable if
there is a Turing Machine M such that:

Initial configuration Final configuration

 w   f (w) 

q0 initial state q f final state

For all w D Domain

A. Senthil - Professor/CSE 12
CREATED BY K. VICTOR BABU
In other words:
A function f is computable if
there is a Turing Machine M such that:


q0 w  q f f ( w)

Initial Final
Configuration Configuration

For all w D Domain

A. Senthil - Professor/CSE 13
CREATED BY K. VICTOR BABU
Example
The function f ( x, y )  x  y is computable

x, y are integers

Turing Machine:

Input string: x0 y unary

Output string: xy 0 unary

A. Senthil - Professor/CSE 14
CREATED BY K. VICTOR BABU
x y

Start  1 1  1 0 1  1 

q0
initial state

The 0 is the delimiter that

separates the two numbers

A. Senthil - Professor/CSE 15
CREATED BY K. VICTOR BABU
x y

Start  1 1  1 0 1  1 

q0 initial state

x y

Finish  1 1  1 1 0 

q f final state
A. Senthil - Professor/CSE 16
CREATED BY K. VICTOR BABU
The 0 helps when we use
the result for other operations

x y

Finish  1 1  1 1 0 

q f final state
A. Senthil - Professor/CSE 17
CREATED BY K. VICTOR BABU
Turing machine for function f ( x, y )  x  y

1  1, R 1  1, R 1  1, L