On the public citation graph

Metatheorems for decision problems on hyperedge replacement graph languages

https://doi.org/10.1007/bf00288976
0 signed · 43 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-18771-5openalex-snapshot
Graph-Grammars and Their Application to Computer Science
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_50openalex-snapshot
On context-free sets of graphs and their monadic second-order theory
inferredcites →https://doi.org/10.1007/3-540-19488-6_129openalex-snapshot
Efficient analysis of graph properties on context-free graph languages
inferredcites →https://doi.org/10.1007/3-540-50728-0_33openalex-snapshot
Graph-theoretic properties compatible with graph derivations
inferredcites →https://doi.org/10.1007/3-540-50939-9_138openalex-snapshot
Decidable boundedness problems for hyperedge-replacement graph grammars
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/bfb0000104openalex-snapshot
On context-free graph languages generated by edge replacement
inferredcites →https://doi.org/10.1007/bfb0000123openalex-snapshot
On graph rewriting systems (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/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/0020-0190(82)90086-2openalex-snapshot
Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
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/0304-3975(87)90050-8openalex-snapshot
Characteristics of graph languages generated by edge replacement
inferredcites →https://doi.org/10.1016/s0019-9958(86)80045-6openalex-snapshot
Boundary NLC graph grammars—Basic definitions, normal forms, and complexity

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1995.1029openalex-snapshot
Node Replacement Graph Languages Squeezed with Chains, Trees, and Forests
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.1006/jcss.2001.1749openalex-snapshot
Separation Results for Separated Apex NLC and NCE Graph Languages
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-56610-4_63openalex-snapshot
Hyperedge replacement with rendezvous
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/3-540-58338-6_75openalex-snapshot
Decision problems for edge grammars
inferred← citeshttps://doi.org/10.1007/978-3-031-09843-7_1openalex-snapshot
Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power
inferred← citeshttps://doi.org/10.1007/978-3-032-29730-3_7openalex-snapshot
Approximately Compatible Graph Predicates
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-59126-6_3openalex-snapshot
Context-Free Graph Grammars
inferred← citeshttps://doi.org/10.1007/bf00289017openalex-snapshot
The complexity of graph languages generated by hyperedge replacement
inferred← citeshttps://doi.org/10.1007/bfb0017373openalex-snapshot
A note on hyperedge replacement
inferred← citeshttps://doi.org/10.1007/bfb0017397openalex-snapshot
A characterization of context-free NCE graph languages by monadic second-order logic on trees
inferred← citeshttps://doi.org/10.1007/bfb0017406openalex-snapshot
Grammatical inference based on hyperedge replacement
inferred← citeshttps://doi.org/10.1007/bfb0017410openalex-snapshot
Tree automata, tree decomposition and hyperedge replacement
inferred← citeshttps://doi.org/10.1007/bfb0017422openalex-snapshot
Computing by graph transformation: Overall aims and new results
inferred← citeshttps://doi.org/10.1007/bfb0017471openalex-snapshot
Graph grammars and tree transducers
inferred← citeshttps://doi.org/10.1007/s002360050106openalex-snapshot
Context-free graph grammars and concatenation of graphs
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(93)90354-vopenalex-snapshot
A comparison of compatible, finite, and inductive graph properties
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80086-8openalex-snapshot
The complexity of connectivity problems on context-free graph languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00258-3openalex-snapshot
HRNCE grammars — a hypergraph generating system with an eNCE way of rewriting
inferred← citeshttps://doi.org/10.1142/9789812384720_0002openalex-snapshot
HYPEREDGE REPLACEMENT GRAPH GRAMMARS
inferred← citeshttps://doi.org/10.3233/fi-1996-253407openalex-snapshot
(UN-)DECIDABILITY OF GEOMETRIC PROPERTIES OF PICTURES GENERATED BY COLLAGE 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.