Scribd
Upload
135 views1 page

Recursive Language

A Recursive Enumerable language is one for which there exists a Turing machine that will accept strings that are part of the language by entering a final state, and will loop forever for strings not part of the language rather than entering a rejecting state. Recursive Enumerable languages are also known as Turing recognizable languages. A Recursive or Decidable language is one for which there exists a Turing machine that will accept strings that are part of the language by entering a final state and reject all other strings not part of the language by entering a rejecting state. Recursive languages are a subset of Recursive Enumerable languages.

Uploaded by

kunal kandhari
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
135 views1 page

Recursive Language

A Recursive Enumerable language is one for which there exists a Turing machine that will accept strings that are part of the language by entering a final state, and will loop forever for strings not part of the language rather than entering a rejecting state. Recursive Enumerable languages are also known as Turing recognizable languages. A Recursive or Decidable language is one for which there exists a Turing machine that will accept strings that are part of the language by entering a final state and reject all other strings not part of the language by entering a rejecting state. Recursive languages are a subset of Recursive Enumerable languages.

Uploaded by

kunal kandhari
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/ 1

b) Recursive Enumerable Language:

The language is said to be Recursive Enumerable if there exists a Turing machine which accepts the
language i.e., it enters into some final state and loops forever for the string which are not part of
language (i.e., it does not enters into some rejecting state instead loops forever).

Recursive Enumerable languages are also called Turing recognizable languages

c) Recursive or Decidable Language:

The language is said to be Recursive if there exists a Turing machine which accepts the language i.e., it
enters into some final state and rejects all the strings which are not part of language (i.e., it enters into
some rejecting state for all the strings which are not part of language).

The relationship between Recursive Enumerable and Recursive languages is shown below:

Recursive Enumerable

Recursive

You might also like