Top "Pushdown-automaton" questions

A pushdown automaton (PDA) is a finite-state automaton with added stack based memory.

PDA to accept a language of strings containing more a's than b's

Produce a PDA to recognise the following language : the language of strings containing more a's than b's I have been …

automata formal-languages pushdown-automaton
Design a PDA of all strings of 0's and 1's so that the number of 1's is twice the number of 0's

While practicing for my final exams I found this question in Automata Theory, Language and Computation by J. Hopcroft, R. …

automata computation-theory pushdown-automaton
Pushdown Automata (PDA)

I'm trying to write a pda pushdown automata that accept a^2n b^n, n>0 but I'm not sure …

pushdown-automaton
DFA to PDA conversion

I am looking for an algorithm to convert a Deterministic Finite Automata to Push Down Automata. Any help appreciated. Thanks!

dfa pushdown-automaton
Design of a “Push Down Automata” that recognizes the language: a^n b^m | n<= m <= 3n

I'm studying for my exam automata and formal languages, I have to design a PDA that recognizes the language: a^…

pushdown-automaton automaton
What language does this Pushdown Automata (PDA) accept?

Exam tomorrow and the prof let us know a question that would be on it :). In the context of this …

context-free-grammar finite-automata pushdown-automaton
PushDown Automaton (PDA) for L={a^(n)b^(n)c^(n)|n>=1}

I am on a fool's errand trying to construct a Pushdown automaton for the non-context-free language L={a^(n)b^(…

computation pushdown-automaton automata-theory jflap
How to design a pushdown automata

How would i design a PDA that accepts balanced parenthesis and brackets for instance ([][]), I am having a hard time …

c++ pushdown-automaton