On the public citation graph

Doubly deterministic tabled OL systems

https://doi.org/10.1007/bf00993057
0 signed · 22 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/3-540-06867-8_3openalex-snapshot
Adding continuous components to L-systems
inferredcites →https://doi.org/10.1007/bf00289079openalex-snapshot
Developmental systems with locally catenative formulas
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-0190(78)90035-2openalex-snapshot
The decidability of υ-local catenativity and of other properties of DOL systems
inferredcites →https://doi.org/10.1016/0160-9327(83)90051-0openalex-snapshot
Advances in information systems science, vol. 8
inferredcites →https://doi.org/10.1016/s0019-9958(73)80004-xopenalex-snapshot
TOL systems and languages
inferredcites →https://doi.org/10.1145/800152.804917openalex-snapshot
Developmental systems and languages
inferredcites →https://doi.org/10.7146/dpb.v3i33.6453openalex-snapshot
The Mathematical Theory of L 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-3-642-95486-3_39openalex-snapshot
Graph-Controlled Systems — An Extension of OL systems
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_6openalex-snapshot
On Compound Lindenmayer Systems
inferred← citeshttps://doi.org/10.1007/bf00993151openalex-snapshot
Cut point languages of markov DTOL systems
inferred← citeshttps://doi.org/10.1007/bf02459961openalex-snapshot
Inference algorithms for developmental systems with cell lineages
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90131-2openalex-snapshot
Adherences of D0L languages
inferred← citeshttps://doi.org/10.1016/b978-0-12-115350-2.50012-9openalex-snapshot
HOMOMORPHISMS: DECIDABILITY, EQUALITY AND TEST SETS1
inferred← citeshttps://doi.org/10.1016/s0019-9958(79)90015-9openalex-snapshot
Decision problems of locally catenative property for DIL systems
inferred← citeshttps://doi.org/10.1016/s0019-9958(81)90618-5openalex-snapshot
Life and death in Markov deterministic tabled OL systems
inferred← citeshttps://doi.org/10.1051/ita/1994283-404251openalex-snapshot
Publications of K. Culik
inferred← citeshttps://doi.org/10.1080/00207169508804411openalex-snapshot
On properties of edtol and rwdol languages and the constructibility of finite morphic refinements
inferred← citeshttps://doi.org/10.1142/s0129054112400096openalex-snapshot
L -SYSTEMS IN GEOMETRIC MODELING
inferred← citeshttps://doi.org/10.25596/jalc-2005-061openalex-snapshot
Some New Aspects of Word-Length Controlled DT0L Systems
inferred← citeshttps://doi.org/10.3233/fi-1999-38402openalex-snapshot
On Accepting Pure Lindenmayer 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.