Deterministic Pushdown Automata (DPDA), Finite Automata with External Storage

Deterministic pushdown automata (DPDA)

PDA: FSM controls the stack. Un-bounded memory, limited last-in-first-out (or LIFO) access.

Stack operations: push, pop, test empty. Abbreviation: Aε = A ∪{ ε }, Bε = B ∪ {ε} .

Definition DPDA:   M= (Q, A, B, f, q0, F) or M= (Q, A, B, f, q0) in the version ‘accept by the empty stack’

Q: set of states, q0: initial state, F ⊆ Q: final or the accepting states
A: input alphabet; B: stack alphabet (convention: comprise a for all a ∈ A , and bottom of stack symbol ¢)

Transition fct f: Q x Aε x Bε -> Q x B*, transitions (q, a, b) -> (q’, v),  a ∈ Aε , b ∈ Bε , v ∈ B*.

If M is shown in a diagram, then this transition is drawn as arrow from q to q’ labeled  a, b -> v  or  a, b/v.

Reading the stack symbol implies ‘pop’. When the stack is not consulted, read ε from stack.

Example: Parenthesis expressions including 2 pairs of parentheses,( ) and [ ] are recognized by a 1-state controller that accepts by the empty stack (that is, additional error or trap state and error transitions are not shown).


Transition function f: current state, input symbol, pop top of stack -> next state, push stack

q, (, ε -> q, (;   q, [, ε -> q, [ ;   q, ), (  -> q, ε ;    q, ], [  -> q, ε

Example: M accepts (through empty stack) palindromes with center marker c. L = {w c wreverse | w ∈ {0, 1}*}.

2091_example of DPDA.jpg

Latest technology based Theory of Computation Online Tutoring Assistance

Tutors, at the, take pledge to provide full satisfaction and assurance in Theory of Computation help via online tutoring. Students are getting 100% satisfaction by online tutors across the globe. Here you can get homework help for Theory of Computation, project ideas and tutorials. We provide email based Theory of Computation help. You can join us to ask queries 24x7 with live, experienced and qualified online tutors specialized in Theory of Computation. Through Online Tutoring, you would be able to complete your homework or assignments at your home. Tutors at the TutorsGlobe are committed to provide the best quality online tutoring assistance for Theory of Computation Homework help and assignment help services. They use their experience, as they have solved thousands of the Theory of Computation assignments, which may help you to solve your complex issues of Theory of Computation. TutorsGlobe assure for the best quality compliance to your homework. Compromise with quality is not in our dictionary. If we feel that we are not able to provide the homework help as per the deadline or given instruction by the student, we refund the money of the student without any delay.

2015 ©TutorsGlobe All rights reserved. TutorsGlobe Rated 4.8/5 based on 34139 reviews.