463 views
2 votes
2 votes

Consider the following languages:
L1={0^(2k)│k≥0}
L2={b∈{0,1}*│b∈L(Mb] ) }
Which of the above languages is TM recognizable?

please explain second one

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
1 votes
1 votes
2 answers
3
ashishgateashish asked Feb 27, 2018
2,429 views
1. Which solution is correct? (or both wrong!)2. Does every 'DFA equivalent' of any NFA has same starting state? if not, please give any smallest example.