A decomposition theorem for hyper-algebraic extensions of language families

DOI10.1016/0304-3975(76)90056-6zbMath0326.68051OpenAlexW1994530538MaRDI QIDQ1225945

Jan van Leeuwen, Derick Wood

Publication date: 1976

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(76)90056-6

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On slicing of K-iteration grammars, Iterating iterated substitution

Cites Work

• Unnamed Item
• Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems
• L systems
• A note on Lindenmayer systems, Szilard languages, spectra, and equivalence
• Description of developmental languages using recurrence systems
• The equality of EOL languages and codings of ol languages