On the public citation graph

Iterated deterministic substitution

https://doi.org/10.1007/bf00264471
0 signed · 31 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-06841-4_87openalex-snapshot
Parallelism in Rewriting Systems
inferredcites →https://doi.org/10.1007/3-540-06867-8_5openalex-snapshot
Three useful results concerning L languages without interactions
inferredcites →https://doi.org/10.1007/3-540-07141-5_215openalex-snapshot
Comparing Several Ways of Context-Independent Parallel Rewriting
inferredcites →https://doi.org/10.1007/bf00263589openalex-snapshot
Nonterminals, homomorphisms and codings in different variations of OL-systems
inferredcites →https://doi.org/10.1007/bf00985664openalex-snapshot
Extension of tabled 0L-systems and languages
inferredcites →https://doi.org/10.1016/0020-0190(76)90087-9openalex-snapshot
A note on K-iteration grammars
inferredcites →https://doi.org/10.1016/s0019-9958(77)90308-4openalex-snapshot
Controlled iteration grammars and full hyper-AFL's
inferredcites →https://doi.org/10.1051/ita/1977110402731openalex-snapshot
On some context free languages that are not deterministic ETOL languages
inferredcites →https://doi.org/10.1080/00207167508803105openalex-snapshot
Parallel OL-languages
inferredcites →https://doi.org/10.1109/swat.1968.12openalex-snapshot
Grammars with macro-like productions
inferredcites →https://doi.org/10.1137/0205022openalex-snapshot
Decomposition Theorems for Various Kinds of Languages Parallel in Nature
inferredcites →https://doi.org/10.1145/800152.804917openalex-snapshot
Developmental systems and languages
inferredcites →https://doi.org/10.7146/dpb.v2i18.6437openalex-snapshot
MACROS, Iterated Substitution and Lindenmayer AFLs
inferredcites →https://doi.org/10.7146/dpb.v3i21.6440openalex-snapshot
Nonterminals, Homomorphisms, and Codings in Different Variations of 0L-Systems
inferredcites →https://doi.org/10.7146/dpb.v3i40.6461openalex-snapshot
A Relationship between ETOL and EDTOL Languages
inferredcites →https://doi.org/10.7146/dpb.v4i47.6466openalex-snapshot
IO and OI
inferredcites →https://doi.org/10.7146/dpb.v4i49.6468openalex-snapshot
Top-down tree transducers with regular look-ahead

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-10003-2_56openalex-snapshot
Languages with homomorphic replacements
inferred← citeshttps://doi.org/10.1007/bf00289071openalex-snapshot
Extended linear macro grammars, iteration grammars, and register programs
inferred← citeshttps://doi.org/10.1007/bf01786975openalex-snapshot
Three hierarchies of transducers
inferred← citeshttps://doi.org/10.1007/bfb0036951openalex-snapshot
Context-free controlled etol 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/0304-3975(81)90100-6openalex-snapshot
Languages with homomorphic replacements
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90195-8openalex-snapshot
Abstract grammars based on transductions
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/s0079-8169(08)62195-9openalex-snapshot
References
inferred← citeshttps://doi.org/10.1051/ita/1978120302131openalex-snapshot
The strong independence of substitution and homomorphic replication
inferred← citeshttps://doi.org/10.1051/ita/1982160100031openalex-snapshot
A note on the undecidability of contextfreeness
inferred← citeshttps://doi.org/10.1080/00207168908803717openalex-snapshot
Controlled bidirectional grammars
inferred← citeshttps://doi.org/10.1145/800133.804333openalex-snapshot
Tree transducers, L systems and two-way machines (Extended Abstract)
inferred← citeshttps://doi.org/10.3990/1.9789090036205openalex-snapshot
Controlled bidirectional grammars
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.