The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
30 views
what is the hierarchy of computational power of different automata? thanks in advance
asked in Theory of Computation by (145 points) | 30 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 (145 points)


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

29,153 questions
36,971 answers
92,116 comments
34,815 users