Scribd
Upload
126 views

TOC PPT Final

This document discusses recursively enumerable (R.E.) and recursive languages. It states that a language is R.E. if there exists a Turing machine that accepts every string in the language and may enter an infinite loop for strings not in the language. Recursive languages are a subset of R.E. languages where the Turing machine must always halt and respond yes or no. The document categorizes languages as decidable if recursive, partially decidable if R.E. but not recursive, and undecidable if it is sometimes partially decidable.

Uploaded by

Sinan Ahmed
Copyright
© © All Rights Reserved
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
126 views

TOC PPT Final

This document discusses recursively enumerable (R.E.) and recursive languages. It states that a language is R.E. if there exists a Turing machine that accepts every string in the language and may enter an infinite loop for strings not in the language. Recursive languages are a subset of R.E. languages where the Turing machine must always halt and respond yes or no. The document categorizes languages as decidable if recursive, partially decidable if R.E. but not recursive, and undecidable if it is sometimes partially decidable.

Uploaded by

Sinan Ahmed
Copyright
© © All Rights Reserved
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/ 12

Recursive &

Recursively
Enumerable
Languages

By Mirza Qurat-ul-ain Zamzam (1087)


& Maria Hanif (1078)
Recursively Enumerable L (R.E)
• A language is called Recursively Enumerable if there
is a Turing Machine that accepts on any input within
the language.
• A language is recursive enumerable if there exists a
Turing machine that accepts every string in the
language and rejects if it is not in the language and
may enter in an infinite loop.
R.E Languages
• There are three possibilities of TM of
R.E language:
Halt and accept the input string ‘w’
{final state}
Halt and reject the input string ‘w’
{non-final state}
Never halt {infinite loop}
R.E Languages
 If w belongs to ‘L’ then
TM will accept the w.
 If w does not belongs to
‘L’ then TM will:
Reject the w. or
Enters infinite loop.
Recursive Languages (REC)
• A language is Recursive if there is a
Turing machine than can always reply
"yes" or "no" if a given string is part of
this language.
• REC languages are also called as Turing
decidable languages.
REC Languages
• There are two possibilities of TM of REC
language:
 Halt and accept the input string ‘w’
{final state}
 Halt and reject the input string ‘w’
{non-final state}
• The TM of REC language is also known as
Total TM.
REC Languages
 If w belongs to ‘L’
then TM will accept
the w.
 If w does not belongs
to ‘L’ then TM will
reject the w.
Relationship between
REC and R.E Languages
• REC languages are
subset of R.E
languages.
• All REC languages are
R.E languages but all
R.E languages may not
be REC languages.
• On the basis of R.E and REC
languages, a language is
categorized into three
categories:
Decidable
Partially decidable
Un decidable
Continued
• A language ‘L’ is called decidable if it is a REC
language.
• A language ‘L’ is called partially decidable if it
is a R.E language.
• A language ‘L’ is called un decidable if it may
sometime be partially decidable.
THANK
YOU

You might also like