Decomposition Theorems for Various Kinds of Languages Parallel in Nature

DOI10.1137/0205022zbMath0332.68058OpenAlexW2018704916MaRDI QIDQ4098671

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)

Related Items (11)

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

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