Decomposition Theorems for Various Kinds of Languages Parallel in Nature

DOI10.1137/0205022zbMATH Open0332.68058OpenAlexW2018704916MaRDI QIDQ4098671FDOQ4098671

Authors: Sven Skyum 

Publication date: 1976

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0205022

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (11)

• Un théorème de duplication pour les forets algébriques
• Decidability of EDT0L structural equivalence
• Branching synchronization grammars with nested tables
• The copying power of one-state tree transducers
• Iterating iterated substitution
• A relationship between ETOL and EDTOL languages
• Three hierarchies of transducers
• Hierarchies of hyper-AFLs
• Context free normal systems and ETOL systems
• Grouped partial ET0L systems and parallel multiple context-free grammars
• Languages with homomorphic replacements

This page was built for publication: Decomposition Theorems for Various Kinds of Languages Parallel in Nature

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