Register

TOC-Turing Machine REL

661 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
manisha11 asked Aug 16, 2018
392 views
TOC, REL
Set of all languages that are not Recursively Enumerable is uncountable. This is true. WHY?
Set of all languages that are not Recursively Enumerable is uncountable.This is true. WHY?
User Avatar
3 votes
3 votes
1 answer
2
hitesh159 asked May 28, 2019
879 views
ace academy test series toc turing machine
User Avatar
3 votes
3 votes
2 answers
3
srestha asked Apr 30, 2019
1,084 views
Made Easy Test Series:TOC-Turing Machine
$P_{1}:$ {$<M>|M $ is a TM that accepts atleast $2$ strings of different length} $P_{2}:$ {$<M>|M $ is a TM and there exists an input whose length less than $100,$ on which $M$ halts } The number of problem which is $RE$ but not $REC$ _____________
$P_{1}:$ {$<M>|M $ is a TM that accepts atleast $2$ strings of different length}$P_{2}:$ {$<M>|M $ is a TM and there exists an input whose length less than $100,$ on whi...
User Avatar
3 votes
3 votes
2 answers
4
Anurag Aizen Mukherj asked Jan 20, 2019
1,033 views
TOC-Turing Machine
Consider the given below Turing Machine and identify the correct language accepted: (a+b)*aa(a+b)* b*a(bb*a)*a b*ab*a None of these The answer is given as (1). But I think (3) is correct as well. Can anyone tell me why only (1) is correct.
Consider the given below Turing Machine and identify the correct language accepted:(a+b)*aa(a+b)*b*a(bb*a)*ab*ab*aNone of theseThe answer is given as (1). But I think (3)...
User Avatar
Link Copied!