On the public citation graph
On the generative power of sequential and parallel programmed graph grammars
0 signed · 40 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-07141-5_223openalex-snapshot
Plan2D — towards a two-dimensional programming language
inferredcites →https://doi.org/10.1007/3-540-08442-8_80openalex-snapshot
On the Relation between Graph Grammars and Graph L-Systems
inferredcites →https://doi.org/10.1007/3-540-08442-8_91openalex-snapshot
Embedding Theorems in the Algebraic Theory of Graph Grammars
inferredcites →https://doi.org/10.1007/978-3-642-48908-2_4openalex-snapshot
Syntaxgesteuerte Programmierung und Inkrementelle Compilation
inferredcites →https://doi.org/10.1007/978-3-642-80732-9_9openalex-snapshot
A Necessary and Sufficient Condition for Chomsky-Productions Over Partially Ordered Symbol Sets
inferredcites →https://doi.org/10.1007/bf02241984openalex-snapshot
Formal languages of labelled graphs
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/bfb0025717openalex-snapshot
Rewriting systems as a tool for relational data base design
inferredcites →https://doi.org/10.1007/bfb0025723openalex-snapshot
Transformations of data base structures
inferredcites →https://doi.org/10.1007/bfb0025724openalex-snapshot
Explicit versus implicit parallel rewriting on graphs
inferredcites →https://doi.org/10.1007/bfb0025726openalex-snapshot
A pumping lemma for context-free graph languages
inferredcites →https://doi.org/10.1016/s0019-9958(70)90135-xopenalex-snapshot
Separable graphs, planar graphs and web grammars
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)80016-8openalex-snapshot
Pair grammars, graph languages and string-to-graph translations
inferredcites →https://doi.org/10.1080/03081077608934737openalex-snapshot
PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT†
inferredcites →https://doi.org/10.1109/swat.1973.11openalex-snapshot
Graph-grammars: An algebraic approach
inferredcites →https://doi.org/10.1145/321495.321504openalex-snapshot
Programmed Grammars and Classes of Formal Languages
inferredcites →https://doi.org/10.1145/321679.321682openalex-snapshot
Linear and Context-Free Graph Grammars
inferredcites →https://doi.org/10.21099/tkbjm/1496158502openalex-snapshot
A system of graph grammars which generates all recursively enumerable sets of labelled graphs
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_43openalex-snapshot
Set theoretic approaches to graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_7openalex-snapshot
Attributed elementary programmed graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_78openalex-snapshot
Issues in the practical use of graph rewriting
inferred← citeshttps://doi.org/10.1007/bf01211933openalex-snapshot
A graph grammar programming style for recognition of music notation
inferred← citeshttps://doi.org/10.1007/bf02283656openalex-snapshot
Attributed graphs, graph-grammars, and Structured Modeling
inferred← citeshttps://doi.org/10.1007/bf03037287openalex-snapshot
P systems with local graph productions
inferred← citeshttps://doi.org/10.1007/bfb0017389openalex-snapshot
An efficient implementation of graph grammars based on the RETE matching algorithm
inferred← citeshttps://doi.org/10.1016/j.patcog.2010.11.015openalex-snapshot
Recent advances in graph-based pattern recognition with applications in document analysis
inferred← citeshttps://doi.org/10.1016/s0167-6423(98)00023-9openalex-snapshot
Graph transformation for specification and programming
inferred← citeshttps://doi.org/10.1109/21.328912openalex-snapshot
Graph-grammar assistance for automated generation of influence diagrams
inferred← citeshttps://doi.org/10.1109/hicss.1990.205376openalex-snapshot
An example-based introduction to graph grammars for modeling
inferred← citeshttps://doi.org/10.1109/icpr.1992.201776openalex-snapshot
A survey of graph grammars: theory and applications
inferred← citeshttps://doi.org/10.1109/ijcnn.1992.287099openalex-snapshot
Tools for dynamic network structures: GRAPE grammars
inferred← citeshttps://doi.org/10.1109/nafips.1996.534770openalex-snapshot
The use of fuzzy graph grammars for recognising noisy two-dimensional images
inferred← citeshttps://doi.org/10.1287/isre.4.1.55openalex-snapshot
Reframing Decision Problems: A Graph-Grammar Approach
inferred← citeshttps://doi.org/10.3233/fi-1996-263404openalex-snapshot
GRAPH GRAMMARS WITH NEGATIVE APPLICATION CONDITIONS
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.