3 votes 3 votes 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\}$ Theory of Computation descriptive isi2012-pcb-cs theory-of-computation turing-machine + – go_editor asked Jun 2, 2016 go_editor 953 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Turing Machine for L={02n |n>=0} is srestha answered Jun 2, 2016 srestha comment Share Follow See all 3 Comments See all 3 3 Comments reply Arjun commented Jun 2, 2016 reply Follow Share There's a typo in question. It is power of 2; not multiple of 2. 3 votes 3 votes shekhar chauhan commented Jun 17, 2016 reply Follow Share which one is final state and which one is dead configuration ? And how did you accept eps move here ? 0 votes 0 votes Falahamin commented Aug 31, 2020 reply Follow Share i think this is for even number of 0s 1 votes 1 votes Please log in or register to add a comment.