Recursive and recursively enumerable languages.

14kviews

written 8.7 years ago by

snehalbailmare • 320

modified 3.9 years ago by

pedsangini276 • 4.8k

Mumbai University > Informatica Technology > Sem 4 > Automata Theory

Marks: 05

Year:May 16

automata theory

ADD COMMENT EDIT

1 Answer

352views

written 8.7 years ago by

snehalbailmare • 320

A language is recursive if there exists a Turing machine that accepts every string in the language and rejects if it is not in the language.

for example lets take Turing machine M and String w: if string w is a member of the Turing machine M, then M halts …

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.