Please tell whether the following is Decidable, Semi-decidable or Undecidable
-
A turing machine halts after running for exactly k steps
-
A turing machine halts after running for atmost k steps
-
A turing machine halts after running for atleast k steps
-
A turing machine accepts a string "x" after running for exactly k steps
-
A turing machine accepts a string "x" after running for atmost k steps
-
A turing machine accepts a string "x" after running for atleast k steps
-
A turing machine visits a particular state "q" exactly k times
-
A turing machine visits a particular state "q" atmost k times
-
A turing machine visits a particular state "q" atleast k times
-
A turing machine visits a particular state "q" exactly k times on input "x"
-
A turing machine visits a particular state "q" atmost k times on input "x"
-
A turing machine visits a particular state "q" atleast k times on input "x"