252 views
0 votes
0 votes

Non-deterministic turing machine, with writing capability is equivalent to.

  1.  Non-deterministic Push down automata
  2.   Deterministic Push down automata
  3.  Finite automata
     
  4.  Linear bounded automata

1 Answer

0 votes
0 votes

Its is a turing machine,its not equivalent to (1,2,3,4) since it has more power than (1,2,3,4) but it can accept all string that are accepted by (1,2,3,4).

  1.  Non-deterministic Push down automata
  2.   Deterministic Push down automata
  3.  Finite automata 
  4.  Linear bounded automata

No related questions found