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. Theory of Computation finite-automata pushdown-automata turing-machine + – Geet asked Nov 1, 2016 retagged Jul 8, 2019 by Cristine Geet 522 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Equivalence is given here DFA=NFA<DPDA<NPDA<DTM=NDTM Aboveallplayer answered Nov 1, 2016 Aboveallplayer comment Share Follow See all 0 reply Please log in or register to add a comment.