On the public citation graph
On proving that certain languages are not ETOL
0 signed · 21 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.
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.
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/bf00288688openalex-snapshot
Direction controlled programmed grammars
inferredcites →https://doi.org/10.1007/bf00288938openalex-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-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.1145/800152.804917openalex-snapshot
Developmental systems and languages
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-45711-9openalex-snapshot
Formal and Natural Computing: Essays Dedicated to Grzegorz Rozenberg
inferred← citeshttps://doi.org/10.1007/3-540-58131-6_45openalex-snapshot
An iteration property of Lindenmayerian power series
inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_39openalex-snapshot
Ogden’s Lemma for ET0L Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-80350-5_26openalex-snapshot
Conditional Tabled Eco-Grammar Systems versus (E)TOL Systems
inferred← citeshttps://doi.org/10.1016/0304-3975(77)90050-0openalex-snapshot
Bibliography of L systems
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00084-4openalex-snapshot
On the Kleijn-Rozenberg k-adjacent languages
inferred← citeshttps://doi.org/10.1016/j.ic.2016.11.002openalex-snapshot
A new pumping lemma for indexed languages, with an application to infinite words
inferred← citeshttps://doi.org/10.1051/ita/1997310100811openalex-snapshot
On lindenmayerian rational subsets of monoids
inferred← citeshttps://doi.org/10.1142/s0129054107005194openalex-snapshot
TABLE-DRIVEN CONTEXT-FREE PICTURE GRAMMARS
inferred← citeshttps://doi.org/10.1142/s0218196718500145openalex-snapshot
Applications of L systems to group theory
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.