edited by
557 views
2 votes
2 votes

Please tell whether the following is Decidable, Semi-decidable or Undecidable
1. The control of a turing machine moves right exactly n times
2. The control of a turing machine moves right atmost n times
3. The control of a turing machine moves right atleast n times
4. A turing machine accepts strings of length exactly "n"
5. A turing machine accepts strings of length atleast "n"
6. A turing machine accepts strings of length atmost "n"
7. A turing machine visits exactly n states
8. A turing machine visits atleast n states
9. A turing machine visits atmost n states
10. A turing machine replaces the characters on the tape exactly n times
11. A turing machine replaces the characters on the tape atleast n times
12. A turing machine replaces the characters on the tape atmost n times

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
3
Abhipsa Panda asked May 24, 2022
148 views
How is equality problem for DCFL decidable?