On the public citation graph

A pumping lemma for context-free graph languages

https://doi.org/10.1007/bfb0025726
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/978-3-663-01443-0_4openalex-snapshot
Graph-Ersetzungssysteme für Anwendungen
inferredcites →https://doi.org/10.1007/bf00289155openalex-snapshot
A class of linearly parsable graph grammars
inferredcites →https://doi.org/10.1007/bfb0025714openalex-snapshot
Introduction to the algebraic theory of graph grammars (a survey)
inferredcites →https://doi.org/10.1007/bfb0025722openalex-snapshot
Locally star gluing formulas for a class of parallel graph grammars
inferredcites →https://doi.org/10.1016/s0019-9958(78)90528-4openalex-snapshot
Context-free graph grammars
inferredcites →https://doi.org/10.1016/s0019-9958(79)90088-3openalex-snapshot
A mathematical investigation of propagating graph 0L systems
inferredcites →https://doi.org/10.1016/s0022-0000(71)80016-8openalex-snapshot
Pair grammars, graph languages and string-to-graph translations

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_41openalex-snapshot
May we introduce to you: Hyperedge replacement
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_60openalex-snapshot
Embedding rule independent theory of graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-19422-3_3openalex-snapshot
Pretty patterns produced by hyperedge replacement
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_138openalex-snapshot
Decidable boundedness problems for hyperedge-replacement graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_29openalex-snapshot
A maximum path length pumping lemma for edge-replacement languages
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_5openalex-snapshot
Five facets of hyperedge replacement beyond context-freeness
inferred← citeshttps://doi.org/10.1007/978-3-030-99253-8_18openalex-snapshot
The Different Shades of Infinite Session Types
inferred← citeshttps://doi.org/10.1007/978-3-031-36709-0_4openalex-snapshot
Moving a Derivation Along a Derivation Preserves the Spine
inferred← citeshttps://doi.org/10.1007/978-3-642-58117-5_17openalex-snapshot
Parallel Hyperedge Replacement
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_18openalex-snapshot
Rule Trees Represent Derivations in Edge Replacement Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_7openalex-snapshot
Graph Grammars with Application Conditions
inferred← citeshttps://doi.org/10.1007/bf02249935openalex-snapshot
On the generative power of sequential and parallel programmed graph grammars
inferred← citeshttps://doi.org/10.1007/bfb0000104openalex-snapshot
On context-free graph languages generated by edge replacement
inferred← citeshttps://doi.org/10.1007/bfb0017373openalex-snapshot
A note on hyperedge replacement
inferred← citeshttps://doi.org/10.1007/bfb0022515openalex-snapshot
Node-label controlled graph grammars (Extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0025715openalex-snapshot
A tutorial and bibliographical survey on graph grammars
inferred← citeshttps://doi.org/10.1007/bfb0028809openalex-snapshot
String grammars with disconnecting
inferred← citeshttps://doi.org/10.1007/bfb0039608openalex-snapshot
Some structural aspects of hypergraph languages generated by hyperedge replacement
inferred← citeshttps://doi.org/10.1007/s11047-025-10051-8openalex-snapshot
A formalization of co-transcriptional splicing as an operation on formal languages
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90051-5openalex-snapshot
String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90050-8openalex-snapshot
Characteristics of graph languages generated by edge replacement
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90106-ropenalex-snapshot
Decidable boundedness problems for sets of graphs generated by hyperedge-replacement
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.07.004openalex-snapshot
Graph grammars with string-regulated rewriting
inferred← citeshttps://doi.org/10.1142/9789812384720_0002openalex-snapshot
HYPEREDGE REPLACEMENT GRAPH 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.