edited by
370 views

1 Answer

Best answer
2 votes
2 votes

This is a TM and Not a PDA. The TM reads the input from MSB to LSB in state q0 and does not alter it. On reaching the end of the string the TM changes direction and starts processing charachters from LSB to MSB. On encountering the first one it switches to state q2. From then onwards it starts flipping bits i.e 0 to 1 and 1 to 0. So the given answer is correct.

selected by

Related questions

0 votes
0 votes
0 answers
1
RahulVerma3 asked Apr 2
48 views
Is this the correct Turing machine for the language $0^n 1^n0^n$?assuming $ at the end and begining of the input tape
0 votes
0 votes
0 answers
3
baofbuiafbi asked Nov 14, 2023
158 views
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.