retagged by
1,615 views
2 votes
2 votes

Which machine is equally powerful in both deterministic and non-deterministic form?

  1. Push Down Automata
  2. Turing machine
  3. Linear Bounded Automata
  4. None of the options
retagged by

2 Answers

Answer:

Related questions

0 votes
0 votes
6 answers
2
admin asked Mar 30, 2020
2,409 views
According to the given language, which among the following expressions does it correspond to ?Language $L=\{x\in\{0,1\}\mid x\text{ is of length 4 or less}\}$.$(0+1+0+1+0...
1 votes
1 votes
3 answers
4