On the public citation graph

Extended linear macro grammars, iteration grammars, and register programs

https://doi.org/10.1007/bf00289071
0 signed · 38 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_49openalex-snapshot
A generalisation of Parikh's theorem in formal language theory
inferredcites →https://doi.org/10.1007/3-540-06867-8openalex-snapshot
L Systems
inferredcites →https://doi.org/10.1007/3-540-06953-4_1openalex-snapshot
Simple program schemes and formal languages
inferredcites →https://doi.org/10.1007/3-540-08353-7_168openalex-snapshot
Acceptors for iteration languages
inferredcites →https://doi.org/10.1007/bf00264471openalex-snapshot
Iterated deterministic substitution
inferredcites →https://doi.org/10.1007/bf00985664openalex-snapshot
Extension of tabled 0L-systems and languages
inferredcites →https://doi.org/10.1007/bfb0023017openalex-snapshot
Theory of Program Structures: Schemes, Semantics, Verification
inferredcites →https://doi.org/10.1016/0020-0190(76)90086-7openalex-snapshot
Copying theorems
inferredcites →https://doi.org/10.1016/0020-0190(78)90036-4openalex-snapshot
Lindenmayer grammars and symbolic testing
inferredcites →https://doi.org/10.1016/0022-0000(78)90051-xopenalex-snapshot
IO and OI. II
inferredcites →https://doi.org/10.1016/0022-0000(80)90058-6openalex-snapshot
Tree transducers, L systems, and two-way machines
inferredcites →https://doi.org/10.1016/s0019-9958(67)90353-1openalex-snapshot
Algebraic automata and context-free sets
inferredcites →https://doi.org/10.1016/s0019-9958(73)90591-3openalex-snapshot
A biologically motivated extension of ALGOL-like languages
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.1016/s0022-0000(73)80040-6openalex-snapshot
Program schemes, recursion schemes, and formal languages
inferredcites →https://doi.org/10.1016/s0022-0000(76)80032-3openalex-snapshot
Un théorème de duplication pour les forêts algébriques
inferredcites →https://doi.org/10.1016/s0022-0000(77)80034-2openalex-snapshot
IO and OI. I
inferredcites →https://doi.org/10.1051/ita/197610r100051openalex-snapshot
Transductions de forêts reconnaissables monadiques, forêts corégulières
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.1109/swat.1968.12openalex-snapshot
Grammars with macro-like productions
inferredcites →https://doi.org/10.1145/1344551.1344563openalex-snapshot
Comparative schematology
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferredcites →https://doi.org/10.1145/322169.322178openalex-snapshot
Stack Machines and Classes of Nonnested Macro Languages
inferredcites →https://doi.org/10.1145/800133.804333openalex-snapshot
Tree transducers, L systems and two-way machines (Extended Abstract)
inferredcites →https://doi.org/10.1145/800152.804917openalex-snapshot
Developmental systems and languages
inferredcites →https://doi.org/10.22028/d291-26058openalex-snapshot
On the interpretation of recursive program schemes
inferredcites →https://doi.org/10.7146/dpb.v2i18.6437openalex-snapshot
MACROS, Iterated Substitution and Lindenmayer AFLs
inferredcites →https://doi.org/10.7146/dpb.v4i47.6466openalex-snapshot
IO and OI

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf00289307openalex-snapshot
The formal power of one-visit attribute grammars
inferred← citeshttps://doi.org/10.1007/s00224-003-1072-zopenalex-snapshot
Tree Series Transformations that Respect Copying
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90006-0openalex-snapshot
Extended macro grammars and stack controlled machines
inferred← citeshttps://doi.org/10.1016/0022-0000(85)90006-6openalex-snapshot
Hierarchies of hyper-AFLs
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90195-8openalex-snapshot
Abstract grammars based on transductions
inferred← citeshttps://doi.org/10.1016/b978-0-12-115350-2.50014-2openalex-snapshot
SOME OPEN QUESTIONS AND RECENT RESULTS ON TREE TRANSDUCERS AND TREE LANGUAGES11Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79-04012.
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.1080/00207168108803261openalex-snapshot
Time and space complexity of inside-out macro languages
inferred← citeshttps://doi.org/10.1080/00207168908803717openalex-snapshot
Controlled bidirectional grammars
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.