1,116 views
0 votes
0 votes

Is this language L accepted by a Turing Machine?

L = a1a2a3a4.........amn    || m,n > 0


Also, what about this language?

L = a1a2a3a4.........ann    || n > 0

1 Answer

–1 votes
–1 votes
is first recursively enumerable lang

and the second recursive?

Related questions

0 votes
0 votes
0 answers
1
sripo asked Jan 5, 2019
523 views
As per the given solution,B should be the correct answer right why is D given as the correct answer as the machine accepts atleast one b.
0 votes
0 votes
2 answers
3
Mk Utkarsh asked Nov 26, 2017
2,011 views
If total turing machine is a proper subset of turing machine then why recursive language is not a proper subset of Recursive Enumerable ?
0 votes
0 votes
1 answer
4