in Theory of Computation retagged by
534 views
0 votes
0 votes
Write about the equivalency of different automata such as DFA, NFA, DPDA, NPDA, DTM, NTM. Which automata or machine can be converted to other machines and why? For example NFA can be converted to DFA, DPDA, NPDA, DTM, NTM.
in Theory of Computation retagged by
by
534 views

1 Answer

0 votes
0 votes
Equivalence is given here

DFA=NFA<DPDA<NPDA<DTM=NDTM