On the public citation graph

On context-free graph languages generated by edge replacement

https://doi.org/10.1007/bfb0000104
0 signed · 41 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-08442-8_94openalex-snapshot
Transformations of Derivation Sequences in Graph Grammars
inferredcites →https://doi.org/10.1007/bfb0025713openalex-snapshot
Graph-Grammars and Their Application to Computer Science and Biology
inferredcites →https://doi.org/10.1007/bfb0025714openalex-snapshot
Introduction to the algebraic theory of graph grammars (a survey)
inferredcites →https://doi.org/10.1007/bfb0025715openalex-snapshot
A tutorial and bibliographical survey on graph grammars
inferredcites →https://doi.org/10.1007/bfb0025726openalex-snapshot
A pumping lemma for context-free graph languages
inferredcites →https://doi.org/10.1016/0020-0255(80)90038-9openalex-snapshot
On the structure of node-label-controlled graph languages
inferredcites →https://doi.org/10.1016/s0019-9958(71)90419-0openalex-snapshot
Cap expressions for context-free languages
inferredcites →https://doi.org/10.1016/s0019-9958(78)90528-4openalex-snapshot
Context-free graph grammars
inferredcites →https://doi.org/10.1016/s0022-0000(71)80023-5openalex-snapshot
A characterization of context-free languages
inferredcites →https://doi.org/10.1109/sfcs.1976.17openalex-snapshot
Graph grammars and global program data flow analysis
inferredcites →https://doi.org/10.1145/321127.321132openalex-snapshot
Two Families of Languages Related to ALGOL
inferredcites →https://doi.org/10.1145/355598.362773openalex-snapshot
Transition network grammars for natural language analysis
inferredcites →https://doi.org/10.21236/ada239419openalex-snapshot
Mathematical Theory of Computation

What points at this work

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

inferred← citeshttps://doi.org/10.1002/ecjb.20191openalex-snapshot
Parsing with truncated counter vectors of terminal symbols
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_47openalex-snapshot
Encoding graphs by derivations and implications for the theory of graph grammars
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_49openalex-snapshot
A representation of graphs by algebraic expressions and its use for graph rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_59openalex-snapshot
Basic notions of actor grammars
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_67openalex-snapshot
Fundamentals of edge-label controlled graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_69openalex-snapshot
An efficient algorithm for the solution of hierarchical networks of constraints
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-50728-0_33openalex-snapshot
Graph-theoretic properties compatible with graph derivations
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/978-1-4613-8476-2openalex-snapshot
The Algorithmic Beauty of Plants
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_38openalex-snapshot
On the Set of all Subgraphs of the Graphs in a Boundary NLC Graph Language
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_7openalex-snapshot
Graph Grammars with Application Conditions
inferred← citeshttps://doi.org/10.1007/bf00288976openalex-snapshot
Metatheorems for decision problems on hyperedge replacement graph languages
inferred← citeshttps://doi.org/10.1007/bf01692060openalex-snapshot
Graph expressions and graph rewritings
inferred← citeshttps://doi.org/10.1007/bfb0000099openalex-snapshot
Aspects of concurrency in graph grammars
inferred← citeshttps://doi.org/10.1007/bfb0022660openalex-snapshot
An algebraic formalism for graphs
inferred← citeshttps://doi.org/10.1007/bfb0039608openalex-snapshot
Some structural aspects of hypergraph languages generated by hyperedge replacement
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90012-aopenalex-snapshot
Edge-label controlled graph grammars
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/0304-3975(92)90259-iopenalex-snapshot
Lyndon trees
inferred← citeshttps://doi.org/10.1109/iros.1994.407572openalex-snapshot
A robot control architecture based on graph grammars and fuzzy logic
inferred← citeshttps://doi.org/10.1145/378456.378503openalex-snapshot
Development models of herbaceous plants for computer imagery purposes
inferred← citeshttps://doi.org/10.13140/rg.2.2.11522.20166openalex-snapshot
Object-Oriented Graph Grammars
inferred← citeshttps://doi.org/10.48550/arxiv.1911.12884openalex-snapshot
Efficient Recognition of Graph Languages
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.