Scribd
Upload
382 views2 pages

Recursive and Recursively Enumerable Languages

Recursive enumerable (RE) languages can be accepted by a Turing machine which may loop on non-members, while recursive languages are decidable by a Turing machine which will always halt and accept or reject. RE languages include all recursive languages and are characterized by Type-0 grammars. Recursive languages exhibit closure under operations like union, concatenation, Kleene closure, and intersection, allowing new recursive languages to be constructed from others. Their complements are also recursive, but RE languages are not closed under complementation.

Uploaded by

jitprosen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
382 views2 pages

Recursive and Recursively Enumerable Languages

Recursive enumerable (RE) languages can be accepted by a Turing machine which may loop on non-members, while recursive languages are decidable by a Turing machine which will always halt and accept or reject. RE languages include all recursive languages and are characterized by Type-0 grammars. Recursive languages exhibit closure under operations like union, concatenation, Kleene closure, and intersection, allowing new recursive languages to be constructed from others. Their complements are also recursive, but RE languages are not closed under complementation.

Uploaded by

jitprosen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Recursive and Recursive Enumerable

Languages
Recursive Enumerable (RE) or Type-0 Language
RE languages or type-0 languages are generated by type-0 grammars. An
RE language can be accepted or recognized by Turing machine which
means it will enter into final state for the strings of the language and may
or may not enter into rejecting state for the strings which are not part of
the language. It means TM can loop forever for the strings which are not a
part of the language. RE languages are also called as Turing
recognizable languages.
Recursive Language (REC)
A recursive language (subset of RE) can be decided by Turing machine
which means it will enter into final state for the strings of language and
rejecting state for the strings which are not part of the language. e.g.; L=
{anbncn|n>=1} is recursive because we can construct a turing machine
which will move to final state if the string is of the form a nbncn else move to
non-final state. So the TM will always halt in this case. REC languages are
also called as Turing decidable languages. The relationship between RE
and REC languages can be shown in Figure 1. 

Closure Properties of Recursive Languages


 Union: If L1 and If L2 are two recursive languages, their union L1∪L2
will also be recursive because if TM halts for L1 and halts for L2, it will
also halt for L1∪L2.
 Concatenation: If L1 and If L2 are two recursive languages, their
concatenation L1.L2 will also be recursive. For Example: 
L1= {anbncn|n>=0}
L2= {dmemfm|m>=0}
L3= L1.L2
= {anbncndmemfm|m>=0 and n>=0} is also recursive.
L1 says n no. of a’s followed by n no. of b’s followed by n no. of c’s. L2
says m no. of d’s followed by m no. of e’s followed by m no. of f’s. Their
concatenation first matches no. of a’s, b’s and c’s and then matches no.
of d’s, e’s and f’s. So it can be decided by TM.
 Kleene Closure: If L1is recursive, its kleene closure L1* will also be
recursive. For Example:
L1= {anbncn|n>=0}
L1*= { anbncn|n>=0}* is also recursive.
 Intersection and complement: If L1 and If L2 are two recursive
languages, their intersection L1 ∩ L2 will also be recursive. For
Example: 
L1= {anbncndm|n>=0 and m>=0}
L2= {ambncndn|n>=0 and m>=0}
L3=L1 ∩ L2
= { anbncndn |n>=0} will be recursive. 
L1 says n no. of a’s followed by n no. of b’s followed by n no. of c’s and
then any no. of d’s. L2 says any no. of a’s followed by n no. of b’s followed
by n no. of c’s followed by n no. of d’s. Their intersection says n no. of a’s
followed by n no. of b’s followed by n no. of c’s followed by n no. of d’s. So it
can be decided by turing machine, hence recursive.
Similarly, complement of recursive language L1 which is Σ*-L1, will also be
recursive.
Note: As opposed to REC languages, RE languages are not closed under
complementation which means complement of RE language need not be RE.

You might also like