On proving that certain languages are not ETOL

DOI10.1007/BF00268142zbMath0349.68034OpenAlexW2065476598MaRDI QIDQ1235015

Andrzej Ehrenfeucht, Grzegorz Rozenberg

Publication date: 1976

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00268142

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (max. 100)

On the Kleijn-Rozenberg k-adjacent languages ⋮ On ETOL systems with rank ⋮ An iteration property of Lindenmayerian power series ⋮ On lindenmayerian rational subsets of monoids ⋮ Applications of L systems to group theory ⋮ Unnamed Item ⋮ A new pumping lemma for indexed languages, with an application to infinite words ⋮ TABLE-DRIVEN CONTEXT-FREE PICTURE GRAMMARS ⋮ Multi grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems
• Direction controlled programmed grammars
• Extension of tabled 0L-systems and languages

This page was built for publication: On proving that certain languages are not ETOL