GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
27 views
what is the hierarchy of computational power of different automata? thanks in advance
asked in Theory of Computation by (123 points)   | 27 views

1 Answer

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. :) :)
answered by (123 points)  


Top Users Sep 2017
  1. Habibkhan

    7828 Points

  2. Warrior

    2746 Points

  3. rishu_darkshadow

    2692 Points

  4. Arjun

    2672 Points

  5. A_i_$_h

    2426 Points

  6. nikunj

    1980 Points

  7. manu00x

    1920 Points

  8. Bikram

    1854 Points

  9. makhdoom ghaya

    1770 Points

  10. SiddharthMahapatra

    1718 Points


26,239 questions
33,805 answers
80,214 comments
31,159 users