On the public citation graph

Graph-Grammars and Their Application to Computer Science

https://doi.org/10.1007/bfb0000094
0 signed · 106 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 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-15198-2_17openalex-snapshot
Amalgamation of graph transformations with applications to synchronization
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_3openalex-snapshot
Specification languages for distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-17218-1_47openalex-snapshot
Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity
inferred← citeshttps://doi.org/10.1007/3-540-17220-3_6openalex-snapshot
Combinatorial hypermap rewriting
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_59openalex-snapshot
Basic notions of actor grammars
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_62openalex-snapshot
Practical applications of precedence graph grammars
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/3-540-18771-5_70openalex-snapshot
A software development environment based on graph technology
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_71openalex-snapshot
Map 0L systems with markers
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_72openalex-snapshot
Graph rewriting with unification and composition
inferred← citeshttps://doi.org/10.1007/3-540-18771-5_74openalex-snapshot
Applications of L-systems to computer imagery
inferred← citeshttps://doi.org/10.1007/3-540-19027-9_13openalex-snapshot
Garp: Graph abstractions for concurrent programming
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_128openalex-snapshot
Efficient algorithms on context-free graph languages
inferred← citeshttps://doi.org/10.1007/3-540-45104-8_23openalex-snapshot
Document Table Recognition by Graph Rewriting
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-50728-0_33openalex-snapshot
Graph-theoretic properties compatible with graph derivations
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_54openalex-snapshot
Monadic second-order logic and context-free graph-grammars
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_10openalex-snapshot
A parser for context free plex grammars
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_6openalex-snapshot
On hyperedge replacement and BNLC graph grammars
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_7openalex-snapshot
Attributed elementary programmed 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-57163-9_29openalex-snapshot
A maximum path length pumping lemma for edge-replacement languages
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-59071-4_47openalex-snapshot
Exponential time analysis of confluent and boundary eNCE graph languages
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/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_87openalex-snapshot
Reconfiguration Graph Grammar for massively parallel, fault tolerant computers
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-1-4615-1529-6_1openalex-snapshot
Summation
inferred← citeshttps://doi.org/10.1007/978-3-540-76298-0_9openalex-snapshot
A Cognitive Support Framework for Ontology Mapping
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-17322-6_1openalex-snapshot
Graph Transformations and Model-Driven Engineering: The Merits of Manfred Nagl
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_10openalex-snapshot
Research Directions in Rewriting Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-72822-8_11openalex-snapshot
On the Structure of Dependence Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-77281-8_23openalex-snapshot
Syntactic and Structural Methods in Document Image Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-77281-8_24openalex-snapshot
Syntactic Analysis of Context—Free Plex Languages for Pattern Recognition
inferred← citeshttps://doi.org/10.1007/978-3-642-83462-2_5openalex-snapshot
Computing the Minimum Error Distance of Graphs in 0(n3) Time with Precedence Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-93360-8_19openalex-snapshot
From Map Systems to Plant Morphogenesis
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_18openalex-snapshot
Rule Trees Represent Derivations in Edge Replacement Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_23openalex-snapshot
Unconventional Leaves (An Application of Map ol-Systems to Biology)
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_24openalex-snapshot
A Uniform Model for the Growth of Biological Organisms: Cooperating Sequential Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_25openalex-snapshot
Graph Technology Applied to a Software Project
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_26openalex-snapshot
Some Systems for Map Generation
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_35openalex-snapshot
Array Languages and Lindenmayer Systems —A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_7openalex-snapshot
Graph Grammars with Application Conditions
inferred← citeshttps://doi.org/10.1007/bf00289017openalex-snapshot
The complexity of graph languages generated by hyperedge replacement
inferred← citeshttps://doi.org/10.1007/bf01178504openalex-snapshot
Context-free hypergraph grammars have the same term-generating power as attribute grammars
inferred← citeshttps://doi.org/10.1007/bf01211933openalex-snapshot
A graph grammar programming style for recognition of music notation
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/bfb0017142openalex-snapshot
Automata and rational expressions on planar graphs
inferred← citeshttps://doi.org/10.1007/bfb0017374openalex-snapshot
Graph grammars based on node rewriting: an introduction to NLC graph grammars
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.1007/bfb0017392openalex-snapshot
Graph grammars and logic programming
inferred← citeshttps://doi.org/10.1007/bfb0017398openalex-snapshot
The term generating power of context-free hypergraph grammars
inferred← citeshttps://doi.org/10.1007/bfb0017411openalex-snapshot
Recognizing rooted context-free flowgraph languages in polynomial time
inferred← citeshttps://doi.org/10.1007/bfb0017421openalex-snapshot
Recognizing edge replacement graph languages in cubic time
inferred← citeshttps://doi.org/10.1007/bfb0017422openalex-snapshot
Computing by graph transformation: Overall aims and new results
inferred← citeshttps://doi.org/10.1007/bfb0032421openalex-snapshot
Concepts for graph-oriented object manipulation
inferred← citeshttps://doi.org/10.1007/bfb0035788openalex-snapshot
Modular system design applying graph grammars techniques
inferred← citeshttps://doi.org/10.1007/bfb0039608openalex-snapshot
Some structural aspects of hypergraph languages generated by hyperedge replacement
inferred← citeshttps://doi.org/10.1016/0010-4485(90)90105-lopenalex-snapshot
Language of topologically valid bounding manifolds
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90012-2openalex-snapshot
Handle NLC grammars and R. E. languages
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90001-2openalex-snapshot
Picture iteration and picture ambiguity
inferred← citeshttps://doi.org/10.1016/0031-3203(86)90050-6openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1016/0097-8493(87)90058-6openalex-snapshot
A linguistic approach to 3-D object recognition
inferred← citeshttps://doi.org/10.1016/0097-8493(89)90060-5openalex-snapshot
Two methods for generating fractals
inferred← citeshttps://doi.org/10.1016/0165-6074(86)90059-1openalex-snapshot
Message passing and graph transformations: A model of actor computation
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90106-xopenalex-snapshot
On hyperedge replacement and BNLC graph grammars
inferred← citeshttps://doi.org/10.1016/0167-9236(93)90049-9openalex-snapshot
Direct manipulation of graph-based decision models
inferred← citeshttps://doi.org/10.1016/0167-9236(93)e0031-8openalex-snapshot
Developments in graph-based modeling for decision support
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90041-6openalex-snapshot
Complexity and decidability for chain code picture languages
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90107-1openalex-snapshot
The membership and equivalence problems for picture languages
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90162-xopenalex-snapshot
A transformation system for generating description languages of chain code pictures
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90180-popenalex-snapshot
Complexity and decidability for restricted classes of picture languages
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90174-zopenalex-snapshot
Nonterminal separation in graph grammars
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90228-3openalex-snapshot
Retreat bounded picture languages
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00202-2openalex-snapshot
Probabilistic hyperedge replacement grammars
inferred← citeshttps://doi.org/10.1016/0306-4379(85)90004-3openalex-snapshot
A graph grammar approach to geographical databases
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90030-8openalex-snapshot
Linear graph grammars: Power and complexity
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.entcs.2005.02.004openalex-snapshot
Petri Nets as Semantic Domain for Diagram Notations
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.041openalex-snapshot
Towards Verifying Model Transformations
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.07.011openalex-snapshot
Simple picture processing based on finite automata and regular grammars
inferred← citeshttps://doi.org/10.1016/j.scico.2013.11.029openalex-snapshot
A sound and complete theory of graph transformations for service programming with sessions and pipelines
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.019openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.050openalex-snapshot
A competitive strategy for distance-aware online shape allocation
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00136-6openalex-snapshot
On regular drawn symbolic picture languages
inferred← citeshttps://doi.org/10.1016/s1045-926x(05)80006-0openalex-snapshot
A formal specification scheme for network diagrams that facilitates automated design
inferred← citeshttps://doi.org/10.1017/s0960129500001353openalex-snapshot
Parallelism and concurrency in high-level replacement systems
inferred← citeshttps://doi.org/10.1051/ita/1993270100071openalex-snapshot
On the structure of recognizable languages of dependence 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/iccv.1990.139513openalex-snapshot
Image interpretation using multi-relational grammars
inferred← citeshttps://doi.org/10.1109/robio.2015.7414624openalex-snapshot
A distributed self-reconfiguration method combining cellular automata and L-systems
inferred← citeshttps://doi.org/10.1109/tase.2008.43openalex-snapshot
UML Model Refactoring with Emphasis on Behavior Preservation
inferred← citeshttps://doi.org/10.1145/1072997.1073000openalex-snapshot
Toward an engineering discipline for grammarware
inferred← citeshttps://doi.org/10.1145/1527033.1527048openalex-snapshot
Fine-grain transformations to refactor UML models
inferred← citeshttps://doi.org/10.1145/1632149.1632154openalex-snapshot
Composite refactoring using fine-grained transformations
inferred← citeshttps://doi.org/10.1145/64135.65015openalex-snapshot
Graph attribution as a specification paradigm
inferred← citeshttps://doi.org/10.1145/64140.65015openalex-snapshot
Graph attribution as a specification paradigm
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.5120/2878-3747openalex-snapshot
Parsing with Neural and Finite Automata Networks: A Graph Grammar Approach
inferred← citeshttps://doi.org/10.7146/dpb.v19i304.6697openalex-snapshot
Graph Grammars for Knowledge Representation
inferred← citeshttps://doi.org/10.7146/dpb.v20i344.6574openalex-snapshot
What is an Efficient Implementation of the lambda-calculus?
inferred← citeshttps://doi.org/10.7146/dpb.v22i453.6771openalex-snapshot
Sharing of Computations
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.