Register

Doubt in Turing Machines

879 views
0 votes
0 votes

Consider the following T.M.
{Note Σ ={a,b}
⌈ = {*,a,b}
Δ = empty cells of Tape.


Which of the following string does not accepted by T.M. ?
(i) aabbaa
(ii) ε
(iii) aabb

User Avatar

1 Answer

0 votes
0 votes
All three rejected

1.halt at state 6

2. € never accepted by TM

3.it halt at state 3
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
1 answer
2
codingo1234 asked Aug 20, 2017
2,237 views
Turing machines and Recursively enumerable languages
If L1 and L2 are Turing-Recognizable then L1 ∪ L2 will be (a) Decidable (b) Turing-recognizable but may not be decidable (c) May not be Turing recognizable (d) None of above
If L1 and L2 are Turing-Recognizable then L1 ∪ L2 will be(a) Decidable(b) Turing-recognizable but may not be decidable(c) May not be Turing recognizable(d) None of abov...
User Avatar
0 votes
0 votes
0 answers
3
sripo asked Jan 5, 2019
539 views
Language accepted by this Turing Machine
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.
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.
User Avatar
0 votes
0 votes
1 answer
4
Lovejeet Singh asked Oct 30, 2018
225 views
Turing machine
What is the meaning of non trivial property related to a language. Please explain with an example.
What is the meaning of non trivial property related to a language. Please explain with an example.
User Avatar
Link Copied!