The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
37 views
which PDA is more Powerful Deterministic or Non Deterministic and why?
closed as a duplicate of: Push Down Automata
asked in Theory of Computation by (251 points)
closed by | 37 views
NPDA is more powerful than DPDA.


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

28,946 questions
36,792 answers
91,048 comments
34,688 users