DFA to PDA conversion

dfa pushdown-automaton
iBiryukov picture iBiryukov · Mar 13, 2011 · Viewed 10.5k times · Source

I am looking for an algorithm to convert a Deterministic Finite Automata to Push Down Automata.

Any help appreciated.

Thanks!

Answer

Austin picture Austin · May 19, 2011

The PDA version of DFA would look the same except each state transition also pushes nothing on the stack and pops nothing off the stack.

Related questions

Design DFA accepting binary strings divisible by a number 'n'

I need to learn how to design a DFA such that given any number 'n', it accepts binary strings {0, 1} whose decimal equivalent number is divisible by 'n'. There will be different DFAs for different 'n', but can somebody give a …

Read More
Need Regular Expression for Finite Automata: Even number of 1s and Even number of 0s

My problem may sounds different to you. I am a beginner and I am learning Finite Automata. I am googing over Internet to find the Regular Expression for Finite Automata of Given Machine Below. Can anyone help me to write "…

Read More
Is L = {a^n b^m | n>m} a regular or irregular language?

I have troubles in solving/proving this problem. Any ideas please?

Read More