Extension of tabled 0L-systems and languages

DOI10.1007/BF00985664zbMath0293.68065OpenAlexW2321795613MaRDI QIDQ4045673

Grzegorz Rozenberg

Publication date: 1973

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (35)

The OI-hierarchy is closed under control ⋮ Equations in virtually abelian groups: Languages and growth ⋮ Unnamed Item ⋮ Branching synchronization grammars with nested tables ⋮ Tree transducers, L systems, and two-way machines ⋮ Two applications of monoid actions to cross-sections ⋮ EDT0L solutions to equations in group extensions ⋮ Using \textsc{edt0l} systems to solve some equations in the solvable Baumslag-Solitar groups ⋮ A note on Lindenmayer systems, Szilard languages, spectra, and equivalence ⋮ Remarks on accepting parallel systems ⋮ The complexity of verbal languages over groups ⋮ Independent parallelism in finite copying parallel rewriting systems ⋮ Literal homomorphisms of ol-languagest ⋮ Literal homomorphisms of ol-languagest ⋮ Comparison of some descriptional complexities of 0L systems obtained by a unifying approach ⋮ Observations about bounded languages and developmental systems ⋮ A limit theorem for set of subwords in deterministic TOL laguages ⋮ ETOL-grammars and N-grammars ⋮ Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems ⋮ Un théorème de duplication pour les forets algébriques ⋮ A relationship between ETOL and EDTOL languages ⋮ More on ETOL systems versus random context grammars ⋮ Surface tree languages and parallel derivation trees ⋮ Basic tree transducers ⋮ On proving that certain languages are not ETOL ⋮ On the decidability of the sequence equivalence problem for DOL-systems ⋮ Iterating iterated substitution ⋮ Tree-based generation of languages of fractals ⋮ On tree transducers for partial functions ⋮ Extended linear macro grammars, iteration grammars, and register programs ⋮ Speed-varying OL systems ⋮ Towards a proof of the decidability of the momentary stagnation of the growth function of D0L systems ⋮ Tree-based picture generation ⋮ Three hierarchies of transducers ⋮ Output string languages of compositions of deterministic macro tree transducers

Cites Work

• Development systems with locally catenative formulas
• Characterization of unary developmental languages
• Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology
• The equivalence problem for deterministic TOL-systems is undecidable
• Description of developmental languages using recurrence systems
• Integral sequential word functions and growth equivalence of lindenmayer systems
• Programmed Grammars and Classes of Formal Languages
• Studies in abstract families of languages
• A note on some systems of lindenmayer
• I. General description and the problem of universal computing ability
• On 0L-Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extension of tabled 0L-systems and languages