Publication:4199562
From MaRDI portal
zbMath0412.68076MaRDI QIDQ4199562
Publication date: 1979
finite automata; context-free languages; pushdown automata; language representation; relative succinctness
68Q45: Formal languages and automata
Related Items
A framework for polynomial-time query learnability, Concise description of finite languages, On reducing the number of stack symbols in a PDA