Pushdown automata are a type of automata that employ stacks. They are more capable than finite state automata but less capable than Turing machines. The term "pushdown" refers to the fact that the stack can be regarded as being "pushed down" like a tray dispenser at a cafeteria, since the operations never work on elements other than the top element. To be used with [automata].
Questions tagged [pushdown-automata]
30 questions
0
votes
1 answer
Construct a PDA for the language
I'm studying automata and I have this problem related to PDAs
I asked this question on stack overflow but then thought this place is more appropriate.
Construct a PDA for the language
$L = \{ w = x_1y_1x_2y_2\dots x_ny_n \mid \text{ where $w$…
Ike
- 3
0
votes
1 answer
Build a pushdown automata to $L=\{a^n b^m c^k | m = n + k\}$
I have this PDA but I would like the accept too when it is receveid a letter b or c as first string.
For example
bbbbaacc
ccaabbbb ${}{}{}{}{}$
cacabbbb
Vagner Wentz
- 115