537 views
0 votes
0 votes
A Turing Machine goes on to an infinite loop on string $\epsilon$. Is it correct? And thus Any language containing $\epsilon$ is not REL.

Is it correct?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
manisha11 asked Aug 16, 2018
382 views
Set of all languages that are not Recursively Enumerable is uncountable.This is true. WHY?
0 votes
0 votes
0 answers
2
0 votes
0 votes
2 answers
3
Zeal asked Dec 23, 2015
417 views
How to tell whether a language is recursively enumerable or not?Also answer the question with proper algorithm :-)
0 votes
0 votes
0 answers
4
ambikesh_ak27 asked Feb 27, 2022
806 views
Convert the given epsilon NFA to minimal DFAhttps://gateoverflow.in/?qa=blob&qa_blobid=10553865129760839637