On the public citation graph
Context-free graph languages of bounded degree are generated by apex graph grammars
0 signed · 57 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/3-540-18771-5_41openalex-snapshot
May we introduce to you: Hyperedge replacement
inferredcites →https://doi.org/10.1007/3-540-18771-5_69openalex-snapshot
An efficient algorithm for the solution of hierarchical networks of constraints
inferredcites →https://doi.org/10.1007/3-540-19488-6_128openalex-snapshot
Efficient algorithms on context-free graph languages
inferredcites →https://doi.org/10.1007/3-540-51498-8_15openalex-snapshot
Context-free NCE graph grammars
inferredcites →https://doi.org/10.1007/3-540-52292-1_6openalex-snapshot
On hyperedge replacement and BNLC graph grammars
inferredcites →https://doi.org/10.1007/3-540-53904-2_106openalex-snapshot
The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
inferredcites →https://doi.org/10.1007/3-540-55719-9_70openalex-snapshot
A Greibach normal form for context-free graph grammars
inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/bf00279953openalex-snapshot
Apex graph grammars and attribute grammars
inferredcites →https://doi.org/10.1007/bf01178504openalex-snapshot
Context-free hypergraph grammars have the same term-generating power as attribute grammars
inferredcites →https://doi.org/10.1007/bf01204169openalex-snapshot
A logical characterization of the sets of hypergraphs defined by Hyperedge Replacement grammars
inferredcites →https://doi.org/10.1007/bf01692060openalex-snapshot
Graph expressions and graph rewritings
inferredcites →https://doi.org/10.1007/bfb0013875openalex-snapshot
Hyperedge Replacement: Grammars and Languages
inferredcites →https://doi.org/10.1007/bfb0017374openalex-snapshot
Graph grammars based on node rewriting: an introduction to NLC graph grammars
inferredcites →https://doi.org/10.1007/bfb0017397openalex-snapshot
A characterization of context-free NCE graph languages by monadic second-order logic on trees
inferredcites →https://doi.org/10.1007/bfb0017410openalex-snapshot
Tree automata, tree decomposition and hyperedge replacement
inferredcites →https://doi.org/10.1007/bfb0026094openalex-snapshot
Decomposition trees: Structured graph representation and efficient algorithms
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(86)90060-7openalex-snapshot
The bounded degree problem for NLC grammars is decidable
inferredcites →https://doi.org/10.1016/0022-0000(90)90002-3openalex-snapshot
Boundary graph grammars with dynamic edge relabeling
inferredcites →https://doi.org/10.1016/0022-0000(91)90018-zopenalex-snapshot
The string generating power of context-free hypergraph grammars
inferredcites →https://doi.org/10.1016/0304-3975(84)90135-xopenalex-snapshot
Restrictions on NLC graph grammars
inferredcites →https://doi.org/10.1016/0304-3975(85)90173-2openalex-snapshot
On greibach normal form construction
inferredcites →https://doi.org/10.1016/0304-3975(86)90120-9openalex-snapshot
On Greibach normal form construction
inferredcites →https://doi.org/10.1016/0304-3975(87)90102-2openalex-snapshot
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
inferredcites →https://doi.org/10.1016/0304-3975(90)90106-ropenalex-snapshot
Decidable boundedness problems for sets of graphs generated by hyperedge-replacement
inferredcites →https://doi.org/10.1016/0304-3975(91)90174-zopenalex-snapshot
Nonterminal separation in graph grammars
inferredcites →https://doi.org/10.1016/0890-5401(89)90030-8openalex-snapshot
Linear graph grammars: Power and complexity
inferredcites →https://doi.org/10.1016/0890-5401(90)90038-jopenalex-snapshot
A comparison of boundary graph grammars and context-free hypergraph grammars
inferredcites →https://doi.org/10.1016/0890-5401(90)90043-hopenalex-snapshot
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
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(05)80022-4openalex-snapshot
Hypergraph languages of bounded degree
inferredcites →https://doi.org/10.1016/s0022-0000(68)80009-1openalex-snapshot
Derivation-bounded languages
inferredcites →https://doi.org/10.1145/151261.151268openalex-snapshot
Efficient decision procedures for graph properties on context-free graph languages
inferredcites →https://doi.org/10.1145/321250.321254openalex-snapshot
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
inferredcites →https://doi.org/10.1145/321406.321412openalex-snapshot
Matrix Equations and Normal Forms for Context-Free Grammars
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1996.0087openalex-snapshot
Regular Description of Context-free Graph Languages
inferred← citeshttps://doi.org/10.1006/jcss.1997.1510openalex-snapshot
Logical Description of Context-free Graph Languages
inferred← citeshttps://doi.org/10.1007/3-540-60618-1_69openalex-snapshot
A uniform approach to graph rewriting: The pullback approach
inferred← citeshttps://doi.org/10.1007/3-540-62559-3_4openalex-snapshot
Node rewriting in hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_3openalex-snapshot
Context-Free Graph Grammars
inferred← citeshttps://doi.org/10.1007/bfb0017471openalex-snapshot
Graph grammars and tree transducers
inferred← citeshttps://doi.org/10.1007/s002240000115openalex-snapshot
A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars
inferred← citeshttps://doi.org/10.1016/j.apal.2003.11.002openalex-snapshot
Algorithmic uses of the Feferman–Vaught Theorem
inferred← citeshttps://doi.org/10.1016/j.cosrev.2018.04.001openalex-snapshot
Graph grammars according to the type of input and manipulated data: A survey
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.09.040openalex-snapshot
Finite graph automata for linear and boundary graph languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.029openalex-snapshot
Quasi-rocking real-time pushdown automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00200-0openalex-snapshot
Node rewriting in graphs and hypergraphs: a categorical framework
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00138-3openalex-snapshot
Double Greibach operator grammars
inferred← citeshttps://doi.org/10.1023/a:1008610714027openalex-snapshot
Pullback as a Generic Graph Rewriting Mechanism
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.