On the public citation graph

An axiomatic definition of context-free rewriting and its application to NLC graph grammars

https://doi.org/10.1007/bfb0035848
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.
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-12727-5_5openalex-snapshot
A survey of NLC grammars
inferredcites →https://doi.org/10.1007/3-540-18771-5_50openalex-snapshot
On context-free sets of graphs and their monadic second-order theory
inferredcites →https://doi.org/10.1007/bf00289115openalex-snapshot
Graph theoretic closure properties of the family of boundary NLC graph languages
inferredcites →https://doi.org/10.1007/bfb0039608openalex-snapshot
Some structural aspects of hypergraph languages generated by hyperedge replacement
inferredcites →https://doi.org/10.1016/0022-0000(81)90025-8openalex-snapshot
Decision problems for node label controlled graph grammars
inferredcites →https://doi.org/10.1016/0304-3975(86)90050-2openalex-snapshot
Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars
inferredcites →https://doi.org/10.1016/0734-189x(86)90023-xopenalex-snapshot
Neighborhood-uniform NLC grammars
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(86)80045-6openalex-snapshot
Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
inferredcites →https://doi.org/10.1016/s0022-0000(77)80034-2openalex-snapshot
IO and OI. I
inferredcites →https://doi.org/10.1145/321127.321132openalex-snapshot
Two Families of Languages Related to ALGOL

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-18771-5_50openalex-snapshot
On context-free sets of graphs and their monadic second-order theory
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_129openalex-snapshot
Efficient analysis of graph properties on context-free graph languages
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_8openalex-snapshot
Maximum Flows in Parametric Graph Templates
inferred← citeshttps://doi.org/10.1016/j.artint.2016.01.006openalex-snapshot
Learning an efficient constructive sampler for graphs
inferred← citeshttps://doi.org/10.14232/actacyb.22.2.2015.9openalex-snapshot
Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars
inferred← citeshttps://doi.org/10.2139/ssrn.4571162openalex-snapshot
A New Graph Grammar Formalism for Robust Syntactic Pattern Recognition
inferred← citeshttps://doi.org/10.3233/fi-2016-1393openalex-snapshot
Designing and Learning Substitutable Plane Graph Grammars
inferred← citeshttps://doi.org/10.37622/ijaer/13.16.2018.12892-12910openalex-snapshot
Some Operations on Multi-Hypergraph Grammar
inferred← citeshttps://doi.org/10.48550/arxiv.2011.07001openalex-snapshot
Parametric Graph Templates: Properties and Algorithms
inferred← citeshttps://doi.org/10.7146/dpb.v23i484.6977openalex-snapshot
Patterns, Graphs and DNA
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.