On the public citation graph
Graph Grammars and Their Application to Computer Science
0 signed · 83 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/bfb0017399openalex-snapshot
Elementary actions on an extended entity-relationship database
inferredcites →https://doi.org/10.1007/bfb0017404openalex-snapshot
The four musicians: analogies and expert systems — a graphic approach
inferredcites →https://doi.org/10.1007/bfb0017409openalex-snapshot
Application of graph grammars to rule-based systems
inferredcites →https://doi.org/10.1007/bfb0017411openalex-snapshot
Recognizing rooted context-free flowgraph languages in polynomial time
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.1997.1510openalex-snapshot
Logical Description of Context-free Graph Languages
inferred← citeshttps://doi.org/10.1006/jcss.1999.1684openalex-snapshot
A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars
inferred← citeshttps://doi.org/10.1007/3-540-45711-9openalex-snapshot
Formal and Natural Computing: Essays Dedicated to Grzegorz Rozenberg
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_16openalex-snapshot
Logic programming as hypergraph Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_5openalex-snapshot
Nondeterministic control structures for graph rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-56346-6_29openalex-snapshot
Path-controlled graph grammars for syntactic pattern recognition
inferred← citeshttps://doi.org/10.1007/3-540-56402-0_51openalex-snapshot
Probabilistic graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-56402-0_52openalex-snapshot
Single vs. double pushout derivations of graphs
inferred← citeshttps://doi.org/10.1007/3-540-56868-9_36openalex-snapshot
Agg — An implementation of algebraic graph rewriting
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-57182-5_10openalex-snapshot
An introduction to dynamic labeled 2-structures
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_1openalex-snapshot
Path-controlled graph grammars for multiresolution image processing and analysis
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_11openalex-snapshot
A computational model for generic graph functions
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_14openalex-snapshot
Relational structures and their partial morphisms in view of single pushout rewriting
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_15openalex-snapshot
Single pushout transformations of equationally defined graph structures with applications to actor systems
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_22openalex-snapshot
Logic based structure rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_24openalex-snapshot
Amalgamated graph transformations and their use for specifying AGG — an algebraic graph grammar system
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_8openalex-snapshot
Jungle rewriting: An abstract description of a lazy narrowing machine
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_88openalex-snapshot
Compiling rewriting onto SIMD and MIMD/SIMD machines
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_395openalex-snapshot
Designing graph drawings by layout graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_47openalex-snapshot
Exponential time analysis of confluent and boundary eNCE graph languages
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_104openalex-snapshot
Drawing graphs with attribute graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_81openalex-snapshot
On the interleaving semantics of transformation units — A step into GRACE
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_95openalex-snapshot
Hierarchically distributed graph transformation
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_97openalex-snapshot
Graph automata for linear graph languages
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_64openalex-snapshot
Rewriting logic as a semantic framework for concurrency: a progress report
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_69openalex-snapshot
Concurrent graph and term graph rewriting
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_12openalex-snapshot
On tractability of Cops and Robbers game
inferred← citeshttps://doi.org/10.1007/978-0-387-35708-9_2openalex-snapshot
On a Grammar-Based Design Language That Supports Automated Design Generation and Creativity
inferred← citeshttps://doi.org/10.1007/978-1-4471-3503-6_3openalex-snapshot
Graph Rewriting Systems and Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-642-01284-6_15openalex-snapshot
Generative Network Automata: A Generalized Framework for Modeling Adaptive Network Dynamics Using Graph Rewritings
inferred← citeshttps://doi.org/10.1007/978-3-642-58117-5_18openalex-snapshot
From Parallel Graph Grammars to Parallel High-Level Replacement Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-58117-5_24openalex-snapshot
Cellworks : An Application to Plant Morphogenesis
inferred← citeshttps://doi.org/10.1007/978-94-010-9733-8_20openalex-snapshot
Predictive Parsing for Unordered Relational Languages
inferred← citeshttps://doi.org/10.1007/978-94-017-0795-4_16openalex-snapshot
An Evolutionary Approach to the Inverse Problem in Rule-Based Design Representations
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/bf03036461openalex-snapshot
A kernel language for programmed rewriting of (hyper)graphs
inferred← citeshttps://doi.org/10.1007/bfb0013469openalex-snapshot
An algebra of graphs and graph rewriting
inferred← citeshttps://doi.org/10.1007/bfb0013816openalex-snapshot
High-level-replacement systems for equational algebraic specifications
inferred← citeshttps://doi.org/10.1007/bfb0017392openalex-snapshot
Graph grammars and logic programming
inferred← citeshttps://doi.org/10.1007/bfb0017395openalex-snapshot
From graph grammars to high level replacement systems
inferred← citeshttps://doi.org/10.1007/bfb0021836openalex-snapshot
GOVE Grammar-Oriented Visualisation Environment
inferred← citeshttps://doi.org/10.1007/bfb0024506openalex-snapshot
The bounded tree-width problem of context-free graph languages
inferred← citeshttps://doi.org/10.1007/s11786-015-0236-yopenalex-snapshot
Graph Grammars, Insertion Lie Algebras, and Quantum Field Theory
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00207-yopenalex-snapshot
On the correctness of modular systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00272-xopenalex-snapshot
Characterization and complexity of uniformly nonprimitive labeled 2-structures
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00301-4openalex-snapshot
Locating the contractum in the double pushout approach
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90090-6openalex-snapshot
Term graph rewriting and garbage collection using opfibrations
inferred← citeshttps://doi.org/10.1016/j.artint.2016.01.006openalex-snapshot
Learning an efficient constructive sampler for graphs
inferred← citeshttps://doi.org/10.1016/j.cad.2017.09.004openalex-snapshot
Graph-based representation of design properties in creating building floorplans
inferred← citeshttps://doi.org/10.1016/j.dam.2008.08.031openalex-snapshot
The NLC-width and clique-width for powers of graphs of bounded tree-width
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.10.027openalex-snapshot
Modeling Pointer Redirection as Cyclic Term-graph Rewriting
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.06.041openalex-snapshot
Towards Secrecy for Rewriting in Weakly Adhesive Categories
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100565openalex-snapshot
Double-pushout-rewriting in S-Cartesian functor categories: Rewriting theory and application to partial triple graphs
inferred← citeshttps://doi.org/10.1016/j.jss.2016.04.070openalex-snapshot
An efficient validation approach for quasi-synchronous checkpointing oriented to distributed diagnosability
inferred← citeshttps://doi.org/10.1016/j.matpr.2021.05.072openalex-snapshot
Computational theory of formal languages on picture languages
inferred← citeshttps://doi.org/10.1016/j.scico.2007.02.002openalex-snapshot
Generalized structured programs and loop trees
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102728openalex-snapshot
Topological consistency preservation with graph transformation schemes
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.12.010openalex-snapshot
Pursuing a fast robber on a graph
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.039openalex-snapshot
Satisfiability of acyclic and almost acyclic CNF formulas
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.04.006openalex-snapshot
Partial pullback complement rewriting
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.07.002openalex-snapshot
Single pushout rewriting in comprehensive systems of graph-like structures
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80022-4openalex-snapshot
Hypergraph languages of bounded degree
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00226-6openalex-snapshot
Generating irregular partitionable data structures
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80212-3openalex-snapshot
Visual Modeling of Distributed Object Systems by Graph Transformation
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80185-9openalex-snapshot
Introduction to COMPUGRAPH
inferred← citeshttps://doi.org/10.1017/s0960129500000554openalex-snapshot
Dynamic labeled 2-structures
inferred← citeshttps://doi.org/10.1017/s0960129500001353openalex-snapshot
Parallelism and concurrency in high-level replacement systems
inferred← citeshttps://doi.org/10.1023/a:1008683005045openalex-snapshot
Distributed Graphs and Graph Transformation
inferred← citeshttps://doi.org/10.1080/00222500801931586openalex-snapshot
Probabilistic Inductive Classes of Graphs
inferred← citeshttps://doi.org/10.1080/07408179908969806openalex-snapshot
Geometrical reasoning based on attributed graph grammar for prismatic parts
inferred← citeshttps://doi.org/10.1109/icsea.2008.59openalex-snapshot
A Formal Definition of Complex Software
inferred← citeshttps://doi.org/10.1515/forum-2021-0119openalex-snapshot
Non-perturbative graph languages, halting problem and complexity
inferred← citeshttps://doi.org/10.22630/mgv.2018.27.1.1openalex-snapshot
Interpreted Graphs and ETPR(k) Graph Grammar Parsing for Syntactic Pattern Recognition
inferred← citeshttps://doi.org/10.70675/ae0fa8dez8e0cz4acdzab10zdddf8e3d70fdopenalex-snapshot
Dynamic software architecture management for collaborative communicating systems
inferred← citeshttps://doi.org/10.70675/c61185b0z5eeez481fza803zc24f00ed5139openalex-snapshot
Gestion autonomique de la QoS au niveau middleware dans l'IoT
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.