On the public citation graph
Grammars on partial graphs
0 signed · 36 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_222openalex-snapshot
Syntax-Directed Description of Incremental Compilers
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/978-3-662-40087-6_16openalex-snapshot
PLAND2D — Towards a Two-Dimensional Programming Language
inferredcites →https://doi.org/10.1007/bf00289616openalex-snapshot
Deriving graphs from graphs by applying a production
inferredcites →https://doi.org/10.1016/0095-8956(71)90074-8openalex-snapshot
Convexity in directed graphs
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.1109/swat.1973.11openalex-snapshot
Graph-grammars: An algebraic approach
inferredcites →https://doi.org/10.2307/3323470openalex-snapshot
Lecture Notes in Economics and Mathematical Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mana.19790910111openalex-snapshot
Pushout‐Properties: An analysis of gluing constructions for graphs
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_80openalex-snapshot
On the Relation between Graph Grammars and Graph L-Systems
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_91openalex-snapshot
Embedding Theorems in the Algebraic Theory of Graph Grammars
inferred← citeshttps://doi.org/10.1007/3-540-08921-7_65openalex-snapshot
Concurrency of manipulations in multidimensional information structures
inferred← citeshttps://doi.org/10.1007/3-540-08921-7_66openalex-snapshot
Deriving structures from structures
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_63openalex-snapshot
Is parallelism already concurrency? Part 1: Derivations in graph grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-31847-7_8openalex-snapshot
Changing Labels in the Double-Pushout Approach Can Be Treated Categorically
inferred← citeshttps://doi.org/10.1007/978-3-642-48908-2_4openalex-snapshot
Syntaxgesteuerte Programmierung und Inkrementelle Compilation
inferred← citeshttps://doi.org/10.1007/978-3-642-67485-3_9openalex-snapshot
Graphentheoretische Modelle und Methoden
inferred← citeshttps://doi.org/10.1007/978-3-642-96650-7_7openalex-snapshot
Knowledge Representation, Utilization, and Acquisition
inferred← citeshttps://doi.org/10.1007/b106390openalex-snapshot
Formal Methods in Software and Systems Modeling: essays dedicated to Hartmut Ehrig on the occasion of his 60th birthday
inferred← citeshttps://doi.org/10.1007/bf00289155openalex-snapshot
A class of linearly parsable graph grammars
inferred← citeshttps://doi.org/10.1007/bf01752403openalex-snapshot
Transformations of structures: An algebraic approach
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/bfb0017395openalex-snapshot
From graph grammars to high level replacement systems
inferred← citeshttps://doi.org/10.1007/bfb0025715openalex-snapshot
A tutorial and bibliographical survey on graph grammars
inferred← citeshttps://doi.org/10.1007/bfb0025720openalex-snapshot
Constructing specifications of abstract data types by replacements
inferred← citeshttps://doi.org/10.1016/0304-3975(80)90016-xopenalex-snapshot
Parallelism and concurrency of graph manipulations
inferred← citeshttps://doi.org/10.1016/s0019-9958(79)90088-3openalex-snapshot
A mathematical investigation of propagating graph 0L systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00139-9openalex-snapshot
Algebraic transformation of unary partial algebras I. double-pushout approach
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00282-xopenalex-snapshot
Algebraic transformation of unary partial algebras II: Single-pushout approach
inferred← citeshttps://doi.org/10.1017/s0960129500001353openalex-snapshot
Parallelism and concurrency in high-level replacement systems
inferred← citeshttps://doi.org/10.1145/322290.322303openalex-snapshot
On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.47.723openalex-snapshot
Graph Passing in Graph Transformation
inferred← citeshttps://doi.org/10.21099/tkbjm/1496158502openalex-snapshot
A system of graph grammars which generates all recursively enumerable sets of labelled graphs
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.