578 views
2 votes
2 votes
what is the hierarchy of computational power of different automata? thanks in advance

1 Answer

0 votes
0 votes
I got the answer for that, this is the hierarchy of the computational power of different automata.

DFA=NFA=epsilon-NFA < DPDA < NPDA(PDA) < Single tape Turing machine = multi tape Turing machine


any further explanation is always welcomed. :) :)

Related questions

3 votes
3 votes
1 answer
1
ankitgupta.1729 asked Mar 3, 2018
696 views
Which is more powerful :- 2-way Non-Deterministic Pushdown Machine(NDPDM) or 2-way Deterministic Pushdown Machine(DPDM) ? (or) Do both machine models have the same power ...
1 votes
1 votes
2 answers
2
Durgesh Singh asked Dec 10, 2017
2,403 views
Realtime DPDA with Null Store,Real time DPDA with final state, DPDA with NULL store,DPDA with final state, NPDA
0 votes
0 votes
1 answer
3
0 votes
0 votes
1 answer
4
Souvik33 asked Jan 5, 2023
388 views
Given set A= {a,b}$^3$What do the formed set look like and what is |A| (cardinility of A)