1^3^n for n>=1 turing machine 111, 111111111, so on

How to design a turing machine which accepts strings of 1 of length power of 3. e.g 111, 111111111, 111111111111111111111111111 so on

1 Answer
Top Voted Recent Answer
1-1 of  1
1 Answer
Top Voted Recent Answer
  • The number of 1 is 3 raised to the power of n, where n is a positive integer There are many solutions. A TM is not an efficient machine for this kind of problem. Any solution will - probably - have a lot of book-keeping and running around with the read/write head.
    0
Theory Of Computation

Didn't get the answer.
Contact people of Talent-Theory Of Computation directly by clicking here