Extension of tabled 0L-systems and languages
From MaRDI portal
Publication:4045673
Cites work
- A note on some systems of lindenmayer
- Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology
- Characterization of unary developmental languages
- Description of developmental languages using recurrence systems
- Development systems with locally catenative formulas
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3383530 (Why is no real title available?)
- scientific article; zbMATH DE number 3420272 (Why is no real title available?)
- I. General description and the problem of universal computing ability
- Integral sequential word functions and growth equivalence of lindenmayer systems
- On 0L-Languages
- Programmed Grammars and Classes of Formal Languages
- Studies in abstract families of languages
- The equivalence problem for deterministic TOL-systems is undecidable
Cited in
(38)- The OI-hierarchy is closed under control
- Tree transducers, L systems, and two-way machines
- 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
- On proving that certain languages are not ETOL
- On the decidability of the sequence equivalence problem for DOL-systems
- Iterating iterated substitution
- On tree transducers for partial functions
- Extended linear macro grammars, iteration grammars, and register programs
- Tree-based picture generation
- Output string languages of compositions of deterministic macro tree transducers
- The complexity of verbal languages over groups
- Independent parallelism in finite copying parallel rewriting systems
- Towards a proof of the decidability of the momentary stagnation of the growth function of D0L systems
- EDT0L solutions to equations in group extensions
- A note on Lindenmayer systems, Szilard languages, spectra, and equivalence
- Literal homomorphisms of ol-languagest
- Literal homomorphisms of ol-languagest
- Observations about bounded languages and developmental systems
- scientific article; zbMATH DE number 3589737 (Why is no real title available?)
- Three hierarchies of transducers
- Remarks on accepting parallel systems
- Equations in virtually abelian groups: Languages and growth
- Two applications of monoid actions to cross-sections
- Basic tree transducers
- Tree-based generation of languages of fractals
- Branching synchronization grammars with nested tables
- Using \textsc{edt0l} systems to solve some equations in the solvable Baumslag-Solitar groups
- Quadratic Diophantine equations, the Heisenberg group and formal languages
- On the ET0L subgroup membership problem in bounded automata groups
- On groups with EDT0L word problem
- Speed-varying OL systems
- Comparison of some descriptional complexities of 0L systems obtained by a unifying approach
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)
