On the public citation graph

Extension of tabled 0L-systems and languages

https://doi.org/10.1007/bf00985664
0 signed · 99 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00289079openalex-snapshot
Developmental systems with locally catenative formulas
inferredcites →https://doi.org/10.1007/bf01702868openalex-snapshot
A note on some systems of lindenmayer
inferredcites →https://doi.org/10.1007/bf01780579openalex-snapshot
Description of developmental languages using recurrence systems
inferredcites →https://doi.org/10.1016/0020-0190(72)90022-1openalex-snapshot
The equivalence problem for deterministic TOL-systems is undecidable
inferredcites →https://doi.org/10.1016/0020-0190(72)90039-7openalex-snapshot
The equivalence problem for deterministic T0L-systems is undecidable
inferredcites →https://doi.org/10.1016/0020-0271(67)90007-1openalex-snapshot
The mathematical theory of context-free languages
inferredcites →https://doi.org/10.1016/0022-5193(68)90079-9openalex-snapshot
Mathematical models for cellular interactions in development I. Filaments with one-sided inputs
inferredcites →https://doi.org/10.1016/0022-5193(68)90080-5openalex-snapshot
Mathematical models for cellular interactions in development II. Simple and branching filaments with two-sided inputs
inferredcites →https://doi.org/10.1016/0022-5193(70)90102-5openalex-snapshot
Role of environment in developmental models
inferredcites →https://doi.org/10.1016/0022-5193(71)90002-6openalex-snapshot
Developmental systems without cellular interactions, their languages and grammars
inferredcites →https://doi.org/10.1016/1385-7258(72)90027-3openalex-snapshot
On the membership question in some Lindenmayer-systems
inferredcites →https://doi.org/10.1016/s0019-9958(71)90164-1openalex-snapshot
On 0L-Languages
inferredcites →https://doi.org/10.1016/s0019-9958(73)80002-6openalex-snapshot
Integral sequential word functions and growth equivalence of lindenmayer systems
inferredcites →https://doi.org/10.1016/s0022-0000(73)80051-0openalex-snapshot
Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology
inferredcites →https://doi.org/10.1016/s0022-5193(69)80030-5openalex-snapshot
Computing ability of a developmental model for filamentous organisms
inferredcites →https://doi.org/10.1016/s0049-237x(09)70393-3openalex-snapshot
Polar Organisms With Apolar Individual Cells
inferredcites →https://doi.org/10.1016/s0049-237x(09)70394-5openalex-snapshot
Cellular Automata, Formal Languages and Developmental Systems
inferredcites →https://doi.org/10.1080/00207167408803093openalex-snapshot
Developmental systems with finite axiom sets Part II. systems with interactions
inferredcites →https://doi.org/10.1080/00207727108920195openalex-snapshot
I. General description and the problem of universal computing ability
inferredcites →https://doi.org/10.1099/00221287-57-2-227openalex-snapshot
Thioguanine-dependent Light Sensitivity of Perithecial Initiation in Sordaria fimicola
inferredcites →https://doi.org/10.1109/focs.1967.3openalex-snapshot
Abstract families of languages
inferredcites →https://doi.org/10.1145/321495.321504openalex-snapshot
Programmed Grammars and Classes of Formal Languages
inferredcites →https://doi.org/10.1145/800152.804917openalex-snapshot
Developmental systems and languages
inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jcss.2001.1816openalex-snapshot
Output String Languages of Compositions of Deterministic Macro Tree Transducers
inferred← citeshttps://doi.org/10.1007/3-540-06841-4_83openalex-snapshot
Trade-Off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems
inferred← citeshttps://doi.org/10.1007/3-540-06867-8_25openalex-snapshot
Bibliography on L systems
inferred← citeshttps://doi.org/10.1007/3-540-07410-4_621openalex-snapshot
L systems, sequences and languages
inferred← citeshttps://doi.org/10.1007/3-540-07854-1_218openalex-snapshot
Context-free programmed grammars and ETOL systems
inferred← citeshttps://doi.org/10.1007/3-540-08342-1_12openalex-snapshot
The sequence equivalence problem for dol systems is decidable
inferred← citeshttps://doi.org/10.1007/3-540-44992-2_6openalex-snapshot
String tile models for DNA computing by self-assembly
inferred← citeshttps://doi.org/10.1007/3-540-45007-6_21openalex-snapshot
Branching Grammars: A Generalization of ET0L Systems
inferred← citeshttps://doi.org/10.1007/3-540-45711-9_3openalex-snapshot
The Delta Operation: From Strings to Trees to Strings
inferred← citeshttps://doi.org/10.1007/3-540-62844-4_5openalex-snapshot
Controlled fuzzy parallel rewriting
inferred← citeshttps://doi.org/10.1007/978-1-4615-8249-6_4openalex-snapshot
The Mathematical Theory of L Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-13435-8_6openalex-snapshot
Bounded Automata Groups are co-ET0L
inferred← citeshttps://doi.org/10.1007/978-3-319-60252-3_5openalex-snapshot
On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_5openalex-snapshot
L Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_34openalex-snapshot
Parentheses Grammars and Lindenmayer Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_8openalex-snapshot
The ETOL Hierarchy is in the oi Hierarchy
inferred← citeshttps://doi.org/10.1007/bf00264471openalex-snapshot
Iterated deterministic substitution
inferred← citeshttps://doi.org/10.1007/bf00264603openalex-snapshot
Hierarchy theorems for two-way finite state transducers
inferred← citeshttps://doi.org/10.1007/bf00268142openalex-snapshot
On proving that certain languages are not ETOL
inferred← citeshttps://doi.org/10.1007/bf00288638openalex-snapshot
Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems
inferred← citeshttps://doi.org/10.1007/bf00289071openalex-snapshot
Extended linear macro grammars, iteration grammars, and register programs
inferred← citeshttps://doi.org/10.1007/bf00976218openalex-snapshot
A note on Lindenmayer systems, Szilard languages, spectra, and equivalence
inferred← citeshttps://doi.org/10.1007/bf01683276openalex-snapshot
Observations about bounded languages and developmental systems
inferred← citeshttps://doi.org/10.1007/bf01786975openalex-snapshot
Three hierarchies of transducers
inferred← citeshttps://doi.org/10.1007/bfb0016288openalex-snapshot
The OI-hierarchy is closed under control
inferred← citeshttps://doi.org/10.1007/bfb0036951openalex-snapshot
Context-free controlled etol systems
inferred← citeshttps://doi.org/10.1007/s11856-025-2746-xopenalex-snapshot
Quadratic Diophantine equations, the Heisenberg group and formal languages
inferred← citeshttps://doi.org/10.1016/0020-0190(76)90004-1openalex-snapshot
More on ETOL Systems versus random context grammars
inferred← citeshttps://doi.org/10.1016/0020-0190(78)90060-1openalex-snapshot
On tree transducers for partial functions
inferred← citeshttps://doi.org/10.1016/0020-0255(78)90033-6openalex-snapshot
Speed-varying ol systems
inferred← citeshttps://doi.org/10.1016/0022-0000(78)90013-2openalex-snapshot
On the structure of derivations in deterministic ET0L systems
inferred← citeshttps://doi.org/10.1016/0022-0000(80)90058-6openalex-snapshot
Tree transducers, L systems, and two-way machines
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90007-9openalex-snapshot
Basic tree transducers
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90003-7openalex-snapshot
Surface tree languages and parallel derivation trees
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90066-9openalex-snapshot
On the decidability of the sequence equivalence problem for DOL-systems
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90076-1openalex-snapshot
A relationship between ET0L and EDT0L languages
inferred← citeshttps://doi.org/10.1016/0304-3975(77)90043-3openalex-snapshot
Iterating iterated substitution
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90026-0openalex-snapshot
The OI-hierarchy is closed under control
inferred← citeshttps://doi.org/10.1016/b978-0-12-115350-2.50013-0openalex-snapshot
A SURVEY OF RESULTS AND OPEN PROBLEMS IN THE MATHEMATICAL THEORY OF L SYSTEMS1
inferred← citeshttps://doi.org/10.1016/j.ic.2008.03.011openalex-snapshot
Comparison of some descriptional complexities of 0L systems obtained by a unifying approach
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2022.11.031openalex-snapshot
EDT0L solutions to equations in group extensions
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2023.04.020openalex-snapshot
Using edt0l systems to solve some equations in the solvable Baumslag-Solitar groups
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.10.001openalex-snapshot
Branching synchronization grammars with nested tables
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.10.005openalex-snapshot
The complexity of verbal languages over groups
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.05.002openalex-snapshot
Towards a proof of the decidability of the momentary stagnation of the growth function of D0L systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.019openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1016/s0019-9958(75)90106-0openalex-snapshot
TOL schemes and control sets
inferred← citeshttps://doi.org/10.1016/s0019-9958(76)90074-7openalex-snapshot
Iterated a-NGSM maps and Γ systems
inferred← citeshttps://doi.org/10.1016/s0019-9958(77)90308-4openalex-snapshot
Controlled iteration grammars and full hyper-AFL's
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90050-5openalex-snapshot
On ETOL systems of finite index
inferred← citeshttps://doi.org/10.1016/s0019-9958(79)90635-1openalex-snapshot
Bounded nesting in macro grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(80)90172-2openalex-snapshot
Space-bounded complexity classes and iterated deterministic substitution
inferred← citeshttps://doi.org/10.1016/s0022-0000(76)80032-3openalex-snapshot
Un théorème de duplication pour les forêts algébriques
inferred← citeshttps://doi.org/10.1016/s0079-8169(08)62195-9openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00168-7openalex-snapshot
Tree-based picture generation
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00280-2openalex-snapshot
Tree-based generation of languages of fractals
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00190-4openalex-snapshot
Independent parallelism in finite copying parallel rewriting systems
inferred← citeshttps://doi.org/10.1023/a:1009939414825openalex-snapshot
Cooperating Distributed Hyperedge Replacement Grammars
inferred← citeshttps://doi.org/10.1051/ita/197610r100051openalex-snapshot
Transductions de forêts reconnaissables monadiques, forêts corégulières
inferred← citeshttps://doi.org/10.1051/ita/1977110402731openalex-snapshot
On some context free languages that are not deterministic ETOL languages
inferred← citeshttps://doi.org/10.1080/00207169508804387openalex-snapshot
Remarks on accepting parallel systems
inferred← citeshttps://doi.org/10.1080/00927872.2019.1710160openalex-snapshot
Two applications of monoid actions to cross-sections
inferred← citeshttps://doi.org/10.1080/07494467.2019.1578123openalex-snapshot
Math and Music, Models and Metaphors: Alberto Posadas' ‘Tree-Like Structures’
inferred← citeshttps://doi.org/10.1109/mahc.1981.10006openalex-snapshot
Formal Languages: Origins and Directions
inferred← citeshttps://doi.org/10.1109/sfcs.1976.35openalex-snapshot
Variations of a new machine model
inferred← citeshttps://doi.org/10.1109/sfcs.1979.19openalex-snapshot
Formal languages: Origins and directions
inferred← citeshttps://doi.org/10.1112/jlms.70538openalex-snapshot
On the ET0L subgroup membership problem in bounded automata groups
inferred← citeshttps://doi.org/10.1142/s0218196722500205openalex-snapshot
Equations in virtually abelian groups: Languages and growth
inferred← citeshttps://doi.org/10.1142/s0218196726500165openalex-snapshot
On groups with EDT0L word problem
inferred← citeshttps://doi.org/10.1145/322169.322178openalex-snapshot
Stack Machines and Classes of Nonnested Macro Languages
inferred← citeshttps://doi.org/10.1145/800076.802451openalex-snapshot
The ω-sequence equivalence problem for DOL systems is decidable
inferred← citeshttps://doi.org/10.1145/800116.803762openalex-snapshot
On the (combinatorial) structure of L languages without interactions (Extended Abstract)
inferred← citeshttps://doi.org/10.1145/800133.804333openalex-snapshot
Tree transducers, L systems and two-way machines (Extended Abstract)
inferred← citeshttps://doi.org/10.70675/8744e3a0z17ccz46abz9246zcc76b744ee39openalex-snapshot
Composición y modelos exógenos : aplicación en la música contemporánea española : la metamodelización en Alberto Posadas (1967) y Hèctor Parra (1976)
inferred← citeshttps://doi.org/10.7146/dpb.v3i33.6453openalex-snapshot
The Mathematical Theory of L Systems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.