Recent questions tagged isi2012-pcb-cs

3 votes
1 answer
6
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\}$
To see more, click for the full list of questions or popular tags.