Extension of tabled 0L-systems and languages
From MaRDI portal
Publication:4045673
DOI10.1007/BF00985664zbMATH Open0293.68065OpenAlexW2321795613MaRDI QIDQ4045673FDOQ4045673
Authors: 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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Description of developmental languages using recurrence systems
- Characterization of unary developmental languages
- Studies in abstract families of languages
- Programmed Grammars and Classes of Formal Languages
- The equivalence problem for deterministic TOL-systems is undecidable
- Development systems with locally catenative formulas
- A note on some systems of lindenmayer
- Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology
- Title not available (Why is that?)
- Integral sequential word functions and growth equivalence of lindenmayer systems
- On 0L-Languages
- I. General description and the problem of universal computing ability
- Title not available (Why is that?)
Cited In (35)
- Towards a proof of the decidability of the momentary stagnation of the growth function of D0L systems
- The complexity of verbal languages over groups
- Observations about bounded languages and developmental systems
- Un théorème de duplication pour les forets algébriques
- On tree transducers for partial functions
- The OI-hierarchy is closed under control
- On the decidability of the sequence equivalence problem for DOL-systems
- Title not available (Why is that?)
- Comparison of some descriptional complexities of 0L systems obtained by a unifying approach
- Basic tree transducers
- Using \textsc{edt0l} systems to solve some equations in the solvable Baumslag-Solitar groups
- More on ETOL systems versus random context grammars
- Branching synchronization grammars with nested tables
- A note on Lindenmayer systems, Szilard languages, spectra, and equivalence
- Tree-based generation of languages of fractals
- Iterating iterated substitution
- ETOL-grammars and N-grammars
- On proving that certain languages are not ETOL
- Tree transducers, L systems, and two-way machines
- A relationship between ETOL and EDTOL languages
- Surface tree languages and parallel derivation trees
- Speed-varying OL systems
- Tree-based picture generation
- Two applications of monoid actions to cross-sections
- Literal homomorphisms of ol-languagest
- Literal homomorphisms of ol-languagest
- Output string languages of compositions of deterministic macro tree transducers
- EDT0L solutions to equations in group extensions
- Three hierarchies of transducers
- Equations in virtually abelian groups: Languages and growth
- Remarks on accepting parallel systems
- Independent parallelism in finite copying parallel rewriting systems
- Extended linear macro grammars, iteration grammars, and register programs
- A limit theorem for set of subwords in deterministic TOL laguages
- Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems
This page was built for publication: Extension of tabled 0L-systems and languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4045673)
