ISI2012-PCB-CS-3

Question

Design a Turing machine that recognizes the unary language consisting of all strings of 0’s whose length is a power of 2, i.e., $L = \{0^{2n} \mid n \geq 0\}$

Answer 1

Turing Machine for L={0²ⁿ |n>=0} is

Comments

There's a typo in question. It is power of 2; not multiple of 2.

---

which one is final state and which one is dead configuration ?

And how did you accept eps move here ?

---

i think this is for even number of 0s