On the public citation graph

Nonterminals, homomorphisms and codings in different variations of OL-systems

https://doi.org/10.1007/bf00288938
0 signed · 25 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/bf00288638openalex-snapshot
Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems
inferredcites →https://doi.org/10.1007/bf00289079openalex-snapshot
Developmental systems with locally catenative formulas
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/s0019-9958(74)90857-2openalex-snapshot
On the decidability of some equivalence problems for DOL-systems

What points at this work

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

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-540-88869-7_1openalex-snapshot
Grzegorz Rozenberg: A Magical Scientist and Brother
inferred← citeshttps://doi.org/10.1007/bf00268142openalex-snapshot
On proving that certain languages are not ETOL
inferred← citeshttps://doi.org/10.1007/bfb0033200openalex-snapshot
A look at the visual modeling of plants using L-systems
inferred← citeshttps://doi.org/10.1007/bfb0083421openalex-snapshot
Systems of equations over a finitely generated free monoid having an effectively findable equivalent finite subsystem
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/0012-365x(78)90056-0openalex-snapshot
A note on DOL length sets
inferred← citeshttps://doi.org/10.1016/0020-0255(77)90001-9openalex-snapshot
New squeezing mechanisms for L systems
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(77)90043-3openalex-snapshot
Iterating iterated substitution
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90101-4openalex-snapshot
Homomorphic images of sentential form languages defined by semi-Thue systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00250-mopenalex-snapshot
Quasi-deterministic OL systems and their representation
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00258-4openalex-snapshot
Pattern systems
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00067-4openalex-snapshot
Slender 0L languages
inferred← citeshttps://doi.org/10.1016/j.jcta.2024.105904openalex-snapshot
The number of primitive words of unbounded exponent in the language of an HD0L-system is finite
inferred← citeshttps://doi.org/10.1016/s0019-9958(77)80003-xopenalex-snapshot
Context sensitive table linden mayer languages and a relation to the LBA problem
inferred← citeshttps://doi.org/10.1016/s0019-9958(77)90058-4openalex-snapshot
Recognition of deterministic ETOL languages in logarithmic space
inferred← citeshttps://doi.org/10.1051/ita/197610r300231openalex-snapshot
Remarks on DOL growth sequences
inferred← citeshttps://doi.org/10.1051/ita/1990240504891openalex-snapshot
Comparison of basic language generating devices (non-deterministic systems)
inferred← citeshttps://doi.org/10.1137/0205022openalex-snapshot
Decomposition Theorems for Various Kinds of Languages Parallel in Nature
inferred← citeshttps://doi.org/10.1137/0216018openalex-snapshot
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable
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.