Ogden’s Lemma for ET0L Languages

DOI10.1007/978-3-642-28332-1_39zbMath1350.68176OpenAlexW34645562MaRDI QIDQ2890219

Max Rabkin

Publication date: 8 June 2012

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28332-1_39

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (4)

MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS ⋮ Unnamed Item ⋮ A new pumping lemma for indexed languages, with an application to infinite words ⋮ On infinite words determined by L systems

This page was built for publication: Ogden’s Lemma for ET0L Languages