Context-Free Language
Context-free grammars define context-free languages using production rules and parse trees, with pushdown automata as their recognizing machines, forming a superset of regular languages.
#pushdown automaton
All posts tagged with "pushdown automaton".