On the public citation graph

Hyperedge Replacement: Grammars and Languages

https://doi.org/10.1007/bfb0013875
0 signed · 257 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.1006/inco.1998.2715openalex-snapshot
Decidability of the Finiteness of Ranges of Tree Transductions
inferred← citeshttps://doi.org/10.1006/inco.1998.2736openalex-snapshot
The Generating Power of Total Deterministic Tree Transducers
inferred← citeshttps://doi.org/10.1006/inco.1999.2807openalex-snapshot
Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations
inferred← citeshttps://doi.org/10.1006/inco.2000.3021openalex-snapshot
The Complexity of the Kn,n-Problem for Node Replacement Graph Languages
inferred← citeshttps://doi.org/10.1006/jagm.1996.0049openalex-snapshot
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
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.1790openalex-snapshot
Hierarchical Graph Transformation
inferred← citeshttps://doi.org/10.1007/11581741_21openalex-snapshot
A Graphical Specification of Model Transformations with Triple Graph Grammars
inferred← citeshttps://doi.org/10.1007/11590156_39openalex-snapshot
Fixpoint Logics on Hierarchical Structures
inferred← citeshttps://doi.org/10.1007/11779148_30openalex-snapshot
Contextual Hypergraph Grammars – A New Approach to the Generation of Hypergraph Languages
inferred← citeshttps://doi.org/10.1007/11841883_11openalex-snapshot
String Generating Hypergraph Grammars with Word Order Restrictions
inferred← citeshttps://doi.org/10.1007/11841883_7openalex-snapshot
Adaptive Star Grammars
inferred← citeshttps://doi.org/10.1007/3-540-28554-7_5openalex-snapshot
Using Graph Transformation for Practical Model-Driven Software Engineering
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_30openalex-snapshot
A General Framework for Types in Graph Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-45104-8_12openalex-snapshot
From Graph Transformation to Rule-Based Programming with Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-45832-8_15openalex-snapshot
Abstraction and Control for Shapely Nested Graph Transformation
inferred← citeshttps://doi.org/10.1007/3-540-45832-8_16openalex-snapshot
Hyperedge Substitution in Basic Atom-Replacement Languages
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_7openalex-snapshot
Hierarchical Graph Transformation
inferred← citeshttps://doi.org/10.1007/3-540-48017-x_36openalex-snapshot
A Note on Graph Splicing Languages
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_25openalex-snapshot
Generating Type Systems for Process Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_29openalex-snapshot
Correct translation of mutually recursive function systems into TOL collage grammars
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_14openalex-snapshot
Model Checking and Higher-Order Recursion
inferred← citeshttps://doi.org/10.1007/3-540-53832-1_52openalex-snapshot
Algebraic approach to graph transformation based on single pushout derivations
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-54233-7_162openalex-snapshot
Better algorithms for the pathwidth and treewidth of graphs
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_2openalex-snapshot
Monadic second-order evaluations on tree-decomposable graphs
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_13openalex-snapshot
Graph grammars as context-dependent rewriting systems: A partial ordering semantics
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_70openalex-snapshot
A Greibach normal form for context-free graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_80openalex-snapshot
Two strikes against perfect phylogeny
inferred← citeshttps://doi.org/10.1007/3-540-56402-0_51openalex-snapshot
Probabilistic graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_14openalex-snapshot
Context-free graph grammars: Separating vertex replacement from hyperedge replacement
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-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-58179-0_52openalex-snapshot
Model checking of macro processes
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-60043-4_55openalex-snapshot
Context-free event domains are recognizable
inferred← citeshttps://doi.org/10.1007/3-540-60618-1_69openalex-snapshot
A uniform approach to graph rewriting: The pullback approach
inferred← citeshttps://doi.org/10.1007/3-540-61052-9_36openalex-snapshot
Graph rewriting and constraint solving for modelling distributed systems with synchronization (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_101openalex-snapshot
Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_103openalex-snapshot
Transformations of graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_77openalex-snapshot
A category-theoretical approach to vertex replacement: The generation of infinite graphs
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_80openalex-snapshot
Graph unification and matching
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_86openalex-snapshot
Using attributed flow graph parsing to recognize clichés in programs
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_89openalex-snapshot
The bounded degree problem for non-obstructing eNCE graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_98openalex-snapshot
The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_99openalex-snapshot
Concatenation of graphs
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_69openalex-snapshot
Concurrent graph and term graph rewriting
inferred← citeshttps://doi.org/10.1007/3-540-62503-8_3openalex-snapshot
Abstract interpretation of the π-calculus
inferred← citeshttps://doi.org/10.1007/3-540-62559-3_10openalex-snapshot
Closure properties of context-free Hyperedge Replacement Systems
inferred← citeshttps://doi.org/10.1007/3-540-62559-3_4openalex-snapshot
Node rewriting in hypergraphs
inferred← citeshttps://doi.org/10.1007/3-540-64299-4_36openalex-snapshot
An inductive view of graph transformation
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_32openalex-snapshot
On Boundedness in Depth in the π-Calculus
inferred← citeshttps://doi.org/10.1007/978-1-4612-1676-6_5openalex-snapshot
Positional Grammars: A Formalism for LR-Like Parsing of Visual Languages
inferred← citeshttps://doi.org/10.1007/978-1-4613-0165-3_10openalex-snapshot
Hypertrellis: A Generalization of Trellis and Factor Graph
inferred← citeshttps://doi.org/10.1007/978-3-030-04771-9_33openalex-snapshot
From Hyperedge Replacement Grammars to Decidable Hyperedge Replacement Games
inferred← citeshttps://doi.org/10.1007/978-3-030-13435-8_17openalex-snapshot
Generalized Predictive Shift-Reduce Parsing for Hyperedge Replacement Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-030-23611-3_4openalex-snapshot
Extending Predictive Shift-Reduce Parsing to Contextual Hyperedge Replacement Grammars
inferred← citeshttps://doi.org/10.1007/978-3-030-51372-6_13openalex-snapshot
Graph Parsing as Graph Transformation
inferred← citeshttps://doi.org/10.1007/978-3-030-68195-1_8openalex-snapshot
Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-complete
inferred← citeshttps://doi.org/10.1007/978-3-030-78946-6_9openalex-snapshot
Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement 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-031-90897-2_1openalex-snapshot
Context-Free Languages of String Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-031-94706-3_6openalex-snapshot
Graph Formulas and Their Translation to Alternating Graph Automata
inferred← citeshttps://doi.org/10.1007/978-3-032-29730-3_2openalex-snapshot
Conditional Borrowing Hyperedge Replacement
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-319-09108-2_13openalex-snapshot
The Subgraph Isomorphism Problem on a Class of Hyperedge Replacement Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-21145-9_2openalex-snapshot
Predictive Top-Down Parsing for Hyperedge Replacement Grammars
inferred← citeshttps://doi.org/10.1007/978-3-319-26529-2_6openalex-snapshot
Tree-Like Grammars and Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_40openalex-snapshot
Between a Rock and a Hard Place – Uniform Parsing for Hyperedge Replacement DAG Grammars
inferred← citeshttps://doi.org/10.1007/978-3-319-61470-0_5openalex-snapshot
Specifying Graph Languages with Type Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-61470-0_6openalex-snapshot
Fusion Grammars: A Novel Approach to the Generation of Graph Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-61470-0_7openalex-snapshot
Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars
inferred← citeshttps://doi.org/10.1007/978-3-319-74730-9_7openalex-snapshot
Generating Efficient Predictive Shift-Reduce Parsers for Hyperedge Replacement Grammars
inferred← citeshttps://doi.org/10.1007/978-3-319-75396-6openalex-snapshot
Graph Transformation, Specifications, and Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-75396-6_13openalex-snapshot
Modular Termination of Graph Transformation
inferred← citeshttps://doi.org/10.1007/978-3-319-75396-6_4openalex-snapshot
A Simple Notion of Parallel Graph Transformation and Its Perspectives
inferred← citeshttps://doi.org/10.1007/978-3-319-92970-5_17openalex-snapshot
Graph-Based Shape Analysis Beyond Context-Freeness
inferred← citeshttps://doi.org/10.1007/978-3-319-92991-0_2openalex-snapshot
Synchronous Hyperedge Replacement Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-25959-6_12openalex-snapshot
Modeling Discontinuous Constituents with Hypergraph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-27755-2_16openalex-snapshot
Model-Based Development of Executable Business Processes for Web Services
inferred← citeshttps://doi.org/10.1007/978-3-540-30203-2_25openalex-snapshot
Parsing String Generating Hypergraph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-31984-9_7openalex-snapshot
Modelling Parametric Contracts and the State Space of Composite Components by Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-39958-2_2openalex-snapshot
Towards Object-Oriented Graphs and Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_2openalex-snapshot
Tree Languages Generated by Context-Free Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_20openalex-snapshot
Hypergraphs as a Uniform Diagram Representation Model
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_4openalex-snapshot
Neighborhood-Preserving Node Replacements
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_4openalex-snapshot
Graph-Based Design and Analysis of Dynamic Software Architectures
inferred← citeshttps://doi.org/10.1007/978-3-540-74610-2_37openalex-snapshot
Representation and Execution of a Graph Grammar in Prolog
inferred← citeshttps://doi.org/10.1007/978-3-540-78663-4_14openalex-snapshot
Service Oriented Architectural Design
inferred← citeshttps://doi.org/10.1007/978-3-540-89020-1_15openalex-snapshot
Shaped Generic Graph Transformation
inferred← citeshttps://doi.org/10.1007/978-3-642-03564-7_10openalex-snapshot
Context-Free Categorical Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-10383-4_34openalex-snapshot
A Service-Oriented UML Profile with Formal Support
inferred← citeshttps://doi.org/10.1007/978-3-642-15928-2_35openalex-snapshot
Correctness of Graph Programs Relative to HR + Conditions
inferred← citeshttps://doi.org/10.1007/978-3-642-15928-2_8openalex-snapshot
Verification of Graph Transformation Systems with Context-Free Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_25openalex-snapshot
A Local Greibach Normal Form for Hyperedge Replacement Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-24897-9_1openalex-snapshot
Selected Decision Problems for Square-Refinement Collage Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-33654-6_30openalex-snapshot
Verification of Graph Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-34176-2_16openalex-snapshot
Contextual Hyperedge Replacement
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/978-3-642-60831-5_77openalex-snapshot
Benefits of Hypergraphs for Program Transformation
inferred← citeshttps://doi.org/10.1007/978-3-662-07675-0_3openalex-snapshot
Grammars with Controlled Derivations
inferred← citeshttps://doi.org/10.1007/978-3-662-45049-9_58openalex-snapshot
Accepting String Graph Splicing System
inferred← citeshttps://doi.org/10.1007/978-94-015-9634-3_22openalex-snapshot
Reading Words in Graphs Generated by Hyperedge Replacement
inferred← citeshttps://doi.org/10.1007/978-981-15-0199-9_36openalex-snapshot
On Generative Power of Rewriting Graph P System
inferred← citeshttps://doi.org/10.1007/bf00872984openalex-snapshot
Categorical principles, techniques and results for high-level-replacement systems in computer science
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/bf01178511openalex-snapshot
Context-free graph languages of bounded degree are generated by apex graph grammars
inferred← citeshttps://doi.org/10.1007/bf01293664openalex-snapshot
Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
inferred← citeshttps://doi.org/10.1007/bf03037287openalex-snapshot
P systems with local graph productions
inferred← citeshttps://doi.org/10.1007/bfb0017407openalex-snapshot
Specifying concurrent languages and systems with Δ-grammars
inferred← citeshttps://doi.org/10.1007/bfb0017410openalex-snapshot
Tree automata, tree decomposition and hyperedge replacement
inferred← citeshttps://doi.org/10.1007/bfb0017421openalex-snapshot
Recognizing edge replacement graph languages in cubic time
inferred← citeshttps://doi.org/10.1007/bfb0017471openalex-snapshot
Graph grammars and tree transducers
inferred← citeshttps://doi.org/10.1007/bfb0024506openalex-snapshot
The bounded tree-width problem of context-free graph languages
inferred← citeshttps://doi.org/10.1007/bfb0029966openalex-snapshot
On the generation of trees by hyperedge replacement
inferred← citeshttps://doi.org/10.1007/bfb0036181openalex-snapshot
Criteria to disprove context-freeness of collage languages
inferred← citeshttps://doi.org/10.1007/s001659970005openalex-snapshot
Graph Transformation Units with Interleaving Semantics
inferred← citeshttps://doi.org/10.1007/s00224-001-1015-5openalex-snapshot
An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs
inferred← citeshttps://doi.org/10.1007/s00224-009-9227-1openalex-snapshot
Fixpoint Logics over Hierarchical Structures
inferred← citeshttps://doi.org/10.1007/s00236-005-0180-4openalex-snapshot
A general framework for types in graph rewriting
inferred← citeshttps://doi.org/10.1007/s00236-015-0223-4openalex-snapshot
Contextual hyperedge replacement
inferred← citeshttps://doi.org/10.1007/s002360050106openalex-snapshot
Context-free graph grammars and concatenation of graphs
inferred← citeshttps://doi.org/10.1007/s002360050152openalex-snapshot
Axioms for generalized graphs, illustrated by a Cantor-Bernstein proposition
inferred← citeshttps://doi.org/10.1007/s10270-014-0403-7openalex-snapshot
ReFlO: an interactive tool for pipe-and-filter domain specification and program generation
inferred← citeshttps://doi.org/10.1007/s10766-019-00639-wopenalex-snapshot
VPPE: A Novel Visual Parallel Programming Environment
inferred← citeshttps://doi.org/10.1007/s10849-009-9109-6openalex-snapshot
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars
inferred← citeshttps://doi.org/10.1007/s11042-021-10624-6openalex-snapshot
Visual exploration of visual parser execution
inferred← citeshttps://doi.org/10.1007/s41870-024-02376-xopenalex-snapshot
Synergizing reaction systems and graph rewriting: a hyper-edge replacement PR system
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90221-topenalex-snapshot
NP-completeness of k-connected hyperedge-replacement languages of order k
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90004-gopenalex-snapshot
Handle-rewriting hypergraph grammars
inferred← citeshttps://doi.org/10.1016/0165-6074(91)90375-4openalex-snapshot
Visual languages their definition and applications in system development
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/0166-218x(94)90026-4openalex-snapshot
k-NLC graphs and polynomial algorithms
inferred← citeshttps://doi.org/10.1016/0168-0072(95)94698-vopenalex-snapshot
The monadic second-order logic of graphs VIII: Orientations
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(91)90222-nopenalex-snapshot
Infinite hypergraphs I. Basic properties
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90148-9openalex-snapshot
The monadic second-order logic of graphs VII: graphs as relational structures
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90063-yopenalex-snapshot
Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90064-zopenalex-snapshot
Monadic second-order evaluations on tree-decomposable graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90065-2openalex-snapshot
Recognising k-connected hypergraphs in cubic time
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90068-5openalex-snapshot
Algebraic approach to single-pushout graph transformation
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/0304-3975(94)90268-2openalex-snapshot
Monadic second-order definable graph transductions: a survey
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00145-xopenalex-snapshot
Basic notions of universal algebra for language theory and graph grammars
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00202-2openalex-snapshot
Probabilistic hyperedge replacement grammars
inferred← citeshttps://doi.org/10.1016/0898-1221(92)90124-zopenalex-snapshot
Introduction to graph grammars with applications to semantic networks
inferred← citeshttps://doi.org/10.1016/bs.adcom.2019.07.003openalex-snapshot
Graph grammar induction
inferred← citeshttps://doi.org/10.1016/j.apal.2003.11.002openalex-snapshot
Algorithmic uses of the Feferman–Vaught Theorem
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.cad.2023.103480openalex-snapshot
Semantic-driven Graph Transformations in Floor Plan Design
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.endm.2006.08.036openalex-snapshot
Automatic Deduction of Induced Subgraphs of Some Infinite Families of Graphs
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.06.040openalex-snapshot
From Chemical Rules to Term Rewriting
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.072openalex-snapshot
Towards a Systematic Method for Proving Termination of Graph Transformation Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.05.012openalex-snapshot
Hierarchical Design Rewriting with Maude
inferred← citeshttps://doi.org/10.1016/j.ic.2015.04.005openalex-snapshot
The generative power of delegation networks
inferred← citeshttps://doi.org/10.1016/j.ic.2017.07.011openalex-snapshot
Language theoretic properties of regular DAG languages
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104520openalex-snapshot
Constant delay traversal of grammar-compressed graphs with bounded rank
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.05.006openalex-snapshot
Model-checking hierarchical structures
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.10.002openalex-snapshot
Uniform parsing for hyperedge replacement grammars
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.01.005openalex-snapshot
Specifying graph languages with type graphs
inferred← citeshttps://doi.org/10.1016/j.jss.2024.112041openalex-snapshot
Modeling microservice architectures
inferred← citeshttps://doi.org/10.1016/j.jvlc.2007.11.003openalex-snapshot
Defining the abstract syntax of visual languages with advanced graph grammars—A case study based on behavior trees
inferred← citeshttps://doi.org/10.1016/j.scico.2014.08.006openalex-snapshot
Robustness and closure properties of recognizable languages in adhesive categories
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.04.038openalex-snapshot
Adaptive star grammars and their languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.006openalex-snapshot
Graph transformation for incremental natural language analysis
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.012openalex-snapshot
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114763openalex-snapshot
On the power of local graph expansion grammars with and without additional restrictions
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)83079-8openalex-snapshot
The obstructions of a minor-closed set of graphs defined by a context-free grammar
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80022-4openalex-snapshot
Hypergraph languages of bounded degree
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80050-9openalex-snapshot
The translation power of top-down tree-to-graph transducers
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/s0167-6423(02)00037-0openalex-snapshot
Concepts and realization of a diagram editor generator based on hypergraph transformation
inferred← citeshttps://doi.org/10.1016/s0167-6423(98)00023-9openalex-snapshot
Graph transformation for specification and programming
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00200-0openalex-snapshot
Node rewriting in graphs and hypergraphs: a categorical framework
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00049-xopenalex-snapshot
Criteria to disprove context freeness of collage languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00449-8openalex-snapshot
Tree-width and the monadic quantifier hierarchy
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00215-0openalex-snapshot
Parallel high-level replacement systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80203-2openalex-snapshot
Context-free hypergraph grammars with node rewriting
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80176-8openalex-snapshot
Parallel Rewriting of Graphs through the Pullback Approach
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80185-9openalex-snapshot
Introduction to COMPUGRAPH
inferred← citeshttps://doi.org/10.1017/cbo9780511974960.002openalex-snapshot
Automata-based presentations of infinite structures
inferred← citeshttps://doi.org/10.1017/s096012950000092xopenalex-snapshot
Equivalent definitions of recognizability for sets of graphs of bounded tree-width
inferred← citeshttps://doi.org/10.1017/s0960129500001353openalex-snapshot
Parallelism and concurrency in high-level replacement systems
inferred← citeshttps://doi.org/10.1017/s0960129500070122openalex-snapshot
Term graph narrowing
inferred← citeshttps://doi.org/10.1017/s0960129501003486openalex-snapshot
Hypergraph construction and its application to the static analysis of concurrent systems
inferred← citeshttps://doi.org/10.1017/s0960129501003528openalex-snapshot
Normal forms for context-free node-rewriting hypergraph grammars
inferred← citeshttps://doi.org/10.1017/s0960129501003589openalex-snapshot
An event structure based semantics for high-level message sequence charts
inferred← citeshttps://doi.org/10.1023/a:1008610714027openalex-snapshot
Pullback as a Generic Graph Rewriting Mechanism
inferred← citeshttps://doi.org/10.1023/a:1008647417502openalex-snapshot
An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories
inferred← citeshttps://doi.org/10.1023/a:1008693303228openalex-snapshot
Graph Rewriting, Constraint Solving and Tiles for Coordinating Distributed Systems
inferred← citeshttps://doi.org/10.1023/a:1008695316594openalex-snapshot
Categorical Approach to Horizontal Structuring and Refinement of High-Level Replacement Systems
inferred← citeshttps://doi.org/10.1023/a:1009939414825openalex-snapshot
Cooperating Distributed Hyperedge Replacement Grammars
inferred← citeshttps://doi.org/10.1023/a:1009962417549openalex-snapshot
The Generative Power of Context-free Node Rewriting in Hypergraphs
inferred← citeshttps://doi.org/10.1057/jos.2015.21openalex-snapshot
Graph transformation based simulation model generation
showing the first 200 of 257 · page through all 257
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.