Register

Turing machine-Gateforum

557 views
2 votes
2 votes
Which of the following is false?

A) L is recursive if and only if it is generated by some TM is canonical order.

B) L is recursively enumerable if and only if there exist a TM which generates L.

C) L is context sensitive if and only if is generated by some TM is canonical order.

D) None of these.

Somebody please explain what is the meaning of option A and C.
User Avatar

1 Answer

0 votes
0 votes
canonical order means by cannon law

by church thesis rule for TM
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
nag.swarna asked Nov 22, 2018
380 views
Gateforum Test Series: Theory of Computation - Turing Machine
anyone please explain this in detail
anyone please explain this in detail
User Avatar
0 votes
0 votes
0 answers
2
nag.swarna asked Nov 22, 2018
257 views
Gateforum Test Series: Theory of Computation - Turing Machine
Im not getting the intution behind this can any one explain
Im not getting the intution behind this can any one explain
User Avatar
0 votes
0 votes
0 answers
3
RahulVerma3 asked Apr 2
51 views
Theory of Computation | design of Turing Machine
Is this the correct Turing machine for the language $0^n 1^n0^n$? assuming $ at the end and begining of the input tape
Is this the correct Turing machine for the language $0^n 1^n0^n$?assuming $ at the end and begining of the input tape
User Avatar
Link Copied!