Register

MadeEasy Test Series: Theory Of Computation - Turing Machine

• edited by
392 views

1 Answer

0 votes
0 votes
Once it reaches the final state there is no transition left for a or b. Thus it will have dead configuration and the string will be accepted
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
0 answers
1
ashish pal asked Jan 22, 2018
475 views
MadeEasy Test Series 2018: Theory of Computation - Turing Machine
Consider the following langauge over Σ = {0, 1}: L = {<M>|M is TM that accept all strings of length atmost 5} Which of the following is true? A.) Decidable and REC B.) Undecidable and RE C.) Undecidable and non RE D.) Decidable but RE
Consider the following langauge over Σ = {0, 1}:L = {<M>|M is TM that accept all strings of length atmost 5}Which of the following is true?A.) Decidable and RECB.) Undec...
User Avatar
1 votes
1 votes
0 answers
3
Chhotu asked Nov 25, 2017
1,032 views
MadeEasy Subject Test: Theory of Computation - Turing Machine
Hi Guys, I think $S_{1}$ is not TRUE because input could be copied in other part of tape. So power of TM will not reduce. What is your opinion ?
Hi Guys, I think $S_{1}$ is not TRUE because input could be copied in other part of tape. So power of TM will not reduce. What is your opinion ?
User Avatar
Link Copied!