On proving that certain languages are not ETOL

DOI10.1007/BF00268142MaRDI QIDQ1235015zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• Direction controlled programmed grammars
• Extension of tabled 0L-systems and languages
• scientific article; zbMATH DE number 3480114 (Why is no real title available?)
• scientific article; zbMATH DE number 3550202 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems

Cited in

(9)

• On ETOL systems with rank
• On the Kleijn-Rozenberg k-adjacent languages
• Table-driven context-free picture grammars
• On lindenmayerian rational subsets of monoids
• Applications of L systems to group theory
• Multi grammars
• Ogden's lemma for subclasses of random context galleries
• An iteration property of Lindenmayerian power series
• A new pumping lemma for indexed languages, with an application to infinite words

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1235015)