Why the following language cannot be defined using a Pushdown Automata (PDA)?
Question
{0 i 1 j 2 k | 0 <= i <= j <= k }
Is it possible to design a PDA for this language?
I think the answer is no, and it can only be defined using at least a context free grammar.
However, I don't know why. I need some discussion and explanation regarding this.
1 answers
solution1
1 2014-12-28 12:11:03
The answer is no. Actually there are neither a CFG nor an NPDA for this language. The proof can be established using a pumping lemma for context free languages.
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.
Related Question
Does this language have a Pushdown Automata ( PDA )?
What language does this Pushdown Automata (PDA) accept?
Automata: CFG for following language
Pushdown Automata for an intersection?
Pushdown Automata for Palindrones
Pushdown automata to Context free: how to do it?
can i push two symbols to the stack of a pushdown automata?
Deterministic Pushdown Automata for L = a^nb^n | n >=0) Python Program
A pushdown automaton that recognizes the negation of a language
What is the language of this deterministic finite automata?
Related Tags