On the public citation graph
Graph expressions and graph rewritings
0 signed · 254 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.1002/mana.19790910111openalex-snapshot
Pushout‐Properties: An analysis of gluing constructions for graphs
inferredcites →https://doi.org/10.1007/3-540-18771-5_49openalex-snapshot
A representation of graphs by algebraic expressions and its use for graph rewriting systems
inferredcites →https://doi.org/10.1007/3-540-18771-5_50openalex-snapshot
On context-free sets of graphs and their monadic second-order theory
inferredcites →https://doi.org/10.1007/978-1-4613-8177-8_6openalex-snapshot
Monadic Computation and Iterative Algebraic Theories
inferredcites →https://doi.org/10.1007/978-3-642-61284-8openalex-snapshot
Fundamentals of Algebraic Specification 2
inferredcites →https://doi.org/10.1007/978-3-642-69962-7openalex-snapshot
Fundamentals of Algebraic Specification 1
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_13openalex-snapshot
Fundamental Properties of Infinite Trees
inferredcites →https://doi.org/10.1007/bf00289616openalex-snapshot
Deriving graphs from graphs by applying a production
inferredcites →https://doi.org/10.1007/bf01752403openalex-snapshot
Transformations of structures: An algebraic approach
inferredcites →https://doi.org/10.1007/bfb0000104openalex-snapshot
On context-free graph languages generated by edge replacement
inferredcites →https://doi.org/10.1007/bfb0000123openalex-snapshot
On graph rewriting systems (Graph-Grammars)
inferredcites →https://doi.org/10.1007/bfb0025714openalex-snapshot
Introduction to the algebraic theory of graph grammars (a survey)
inferredcites →https://doi.org/10.1007/bfb0039608openalex-snapshot
Some structural aspects of hypergraph languages generated by hyperedge replacement
inferredcites →https://doi.org/10.1016/0022-0000(83)90038-7openalex-snapshot
Algebraic characterization of reducible flowcharts
inferredcites →https://doi.org/10.1016/0304-3975(83)90059-2openalex-snapshot
Fundamental properties of infinite trees
inferredcites →https://doi.org/10.1016/0304-3975(86)90050-2openalex-snapshot
Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars
inferredcites →https://doi.org/10.1016/0304-3975(87)90102-2openalex-snapshot
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferredcites →https://doi.org/10.1016/s0019-9958(67)90353-1openalex-snapshot
Algebraic automata and context-free sets
inferredcites →https://doi.org/10.1016/s0019-9958(67)90670-5openalex-snapshot
Automata in general algebras
inferredcites →https://doi.org/10.1016/s0049-237x(08)71949-9openalex-snapshot
Monadic Computation And Iterative Algebraic Theories
inferredcites →https://doi.org/10.1109/swat.1973.11openalex-snapshot
Graph-grammars: An algebraic approach
inferredcites →https://doi.org/10.1137/0209002openalex-snapshot
Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation
inferredcites →https://doi.org/10.1145/321127.321132openalex-snapshot
Two Families of Languages Related to ALGOL
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
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.1995.1029openalex-snapshot
Node Replacement Graph Languages Squeezed with Chains, Trees, and Forests
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/jcss.1996.0048openalex-snapshot
Language Theoretic and Algorithmic Properties ofd-dimensional Collages and Patterns in a Grid
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.1997.1515openalex-snapshot
Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems
inferred← citeshttps://doi.org/10.1006/jcss.1998.1573openalex-snapshot
The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers
inferred← citeshttps://doi.org/10.1006/jcss.2001.1749openalex-snapshot
Separation Results for Separated Apex NLC and NCE Graph Languages
inferred← citeshttps://doi.org/10.1007/3-540-17220-3_6openalex-snapshot
Combinatorial hypermap rewriting
inferred← citeshttps://doi.org/10.1007/3-540-18420-1_50openalex-snapshot
Concurrent term rewriting as a model of computation
inferred← citeshttps://doi.org/10.1007/3-540-19422-3_3openalex-snapshot
Pretty patterns produced by hyperedge replacement
inferred← citeshttps://doi.org/10.1007/3-540-45066-1_9openalex-snapshot
A Finite Complete Set of Equations Generating Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48068-4_23openalex-snapshot
Token-Controlled Place Refinement in Hierarchical Petri Nets with Application to Active Document Workflow
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-48483-3_7openalex-snapshot
An Algebra of Graph Derivations Using Finite (co—) Limit Double Theories
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_34openalex-snapshot
The monadic second-order logic of graphs : Definable sets of finite graphs
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_35openalex-snapshot
On systems of equations defining infinite graphs
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_138openalex-snapshot
Decidable boundedness problems for hyperedge-replacement graph grammars
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-51498-8_15openalex-snapshot
Context-free NCE graph 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-54233-7_161openalex-snapshot
Finding minimal forbidden minors using a finite congruence
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-55121-2_4openalex-snapshot
Graph rewriting systems and their application to network reliability analysis
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_7openalex-snapshot
Monadic second-order definable graph transductions
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-56402-0_51openalex-snapshot
Probabilistic graph grammars
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_63openalex-snapshot
Hyperedge replacement with rendezvous
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_5openalex-snapshot
Five facets of hyperedge replacement beyond context-freeness
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_20openalex-snapshot
Set-theoretic graph rewriting
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_21openalex-snapshot
On relating rewriting systems and graph grammars to event structures
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_5openalex-snapshot
Graph-grammar semantics of a higher-order programming language for distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_48openalex-snapshot
An introduction to category-based equational logic
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_110openalex-snapshot
Decomposable structures, Boolean function representations, and optimization
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-61228-9_100openalex-snapshot
HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_106openalex-snapshot
A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths
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_88openalex-snapshot
The use of tree transducers to compute translations between graph algebras
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_90openalex-snapshot
Process specification and verification
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-61604-7_64openalex-snapshot
Rewriting logic as a semantic framework for concurrency: a progress report
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-3-031-13188-2_22openalex-snapshot
Synthesis and Analysis of Petri Nets from Causal Specifications
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_8openalex-snapshot
Maximum Flows in Parametric Graph Templates
inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_12openalex-snapshot
Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-21145-9_8openalex-snapshot
Reachability in Graph Transformation Systems and Slice Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_22openalex-snapshot
MSO Logic and the Partial Order Semantics of Place/Transition-Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_13openalex-snapshot
Complete Axiomatization of an Algebraic Construction of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-30203-2_23openalex-snapshot
Representing First-Order Logic Using Graphs
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_9openalex-snapshot
Node Replacement in Hypergraphs: Translating NCE Rewriting into the Pullback Approacht
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_3openalex-snapshot
Treewidth: Structure and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-75414-5_3openalex-snapshot
From Tree-Based Generators to Delegation Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-85332-9_5openalex-snapshot
A Rewriting Approach to Graph Invariants
inferred← citeshttps://doi.org/10.1007/978-3-540-87405-8_23openalex-snapshot
On the Recognizability of Arrow and Graph Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-89020-1_30openalex-snapshot
Simulating Set-Valued Transformations with Algorithmic Graph Transformation Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-00593-0_2openalex-snapshot
Rewriting Logic Semantics and Verification of Model Transformations
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_12openalex-snapshot
Characterizing Compressibility of Disjoint Subgraphs with NLC 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-28332-1_38openalex-snapshot
Canonizable Partial Order Generators
inferred← citeshttps://doi.org/10.1007/978-3-642-33654-6_18openalex-snapshot
Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking
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-58622-4_10openalex-snapshot
Research Directions in Rewriting Logic
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-662-52921-8_13openalex-snapshot
Causality in Bounded Petri Nets is MSO Definable
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_1openalex-snapshot
Efficient Computations in Tree-Like Graphs
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/bf01178511openalex-snapshot
Context-free graph languages of bounded degree are generated by apex graph grammars
inferred← citeshttps://doi.org/10.1007/bf01178667openalex-snapshot
Synthesized and inherited functions
inferred← citeshttps://doi.org/10.1007/bf01204169openalex-snapshot
A logical characterization of the sets of hypergraphs defined by Hyperedge Replacement 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/bf01758777openalex-snapshot
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
inferred← citeshttps://doi.org/10.1007/bf02088013openalex-snapshot
The monadic second-order logic of graphs, II: Infinite graphs of bounded width
inferred← citeshttps://doi.org/10.1007/bf02115752openalex-snapshot
Algorithms for recognition of regular properties and decomposition of recursive graph families
inferred← citeshttps://doi.org/10.1007/bfb0013469openalex-snapshot
An algebra of graphs and graph rewriting
inferred← citeshttps://doi.org/10.1007/bfb0015421openalex-snapshot
Learning of restricted RNLC graph languages
inferred← citeshttps://doi.org/10.1007/bfb0017382openalex-snapshot
An algebraic theory of graph reduction
inferred← citeshttps://doi.org/10.1007/bfb0017385openalex-snapshot
General solution to a system of recursive equations on hypergraphs
inferred← citeshttps://doi.org/10.1007/bfb0017392openalex-snapshot
Graph grammars and logic programming
inferred← citeshttps://doi.org/10.1007/bfb0017393openalex-snapshot
Graphs as relational structures : An algebraic and logical approach
inferred← citeshttps://doi.org/10.1007/bfb0017394openalex-snapshot
Context-free handle-rewriting hypergraph grammars
inferred← citeshttps://doi.org/10.1007/bfb0017397openalex-snapshot
A characterization of context-free NCE graph languages by monadic second-order logic on trees
inferred← citeshttps://doi.org/10.1007/bfb0017398openalex-snapshot
The term generating power of context-free hypergraph grammars
inferred← citeshttps://doi.org/10.1007/bfb0017406openalex-snapshot
Grammatical inference based on hyperedge replacement
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/bfb0017422openalex-snapshot
Computing by graph transformation: Overall aims and new results
inferred← citeshttps://doi.org/10.1007/bfb0017471openalex-snapshot
Graph grammars and tree transducers
inferred← citeshttps://doi.org/10.1007/bfb0017490openalex-snapshot
A rank hierarchy for deterministic tree-walking transducers
inferred← citeshttps://doi.org/10.1007/bfb0028596openalex-snapshot
Recognizability equals monadic second-order definability for sets of graphs of bounded tree-width
inferred← citeshttps://doi.org/10.1007/bfb0035762openalex-snapshot
The definability of equational graphs in monadic second-order logic
inferred← citeshttps://doi.org/10.1007/bfb0039608openalex-snapshot
Some structural aspects of hypergraph languages generated by hyperedge replacement
inferred← citeshttps://doi.org/10.1007/bfb0055804openalex-snapshot
When can an equational simple graph be generated by hyperedge replacement?
inferred← citeshttps://doi.org/10.1007/bfb0055807openalex-snapshot
Representing hyper-graphs by regular languages
inferred← citeshttps://doi.org/10.1007/pl00013320openalex-snapshot
Efficient recognition algorithms for boundary and linear eNCE graph languages
inferred← citeshttps://doi.org/10.1007/s002240000115openalex-snapshot
A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars
inferred← citeshttps://doi.org/10.1007/s00236-004-0149-8openalex-snapshot
An axiomatization of graphs
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-006-0006-zopenalex-snapshot
Recognizability of graph and pattern languages
inferred← citeshttps://doi.org/10.1007/s002360050106openalex-snapshot
Context-free graph grammars and concatenation of graphs
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.1016/0004-3702(91)90059-sopenalex-snapshot
Constraint relaxation may be perfect
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90140-3openalex-snapshot
Undecidability of the bandwidth problem on linear graph languages
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90018-zopenalex-snapshot
The string generating power of context-free hypergraph grammars
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90004-gopenalex-snapshot
Handle-rewriting hypergraph grammars
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)90019-1openalex-snapshot
The monadic second order logic of graphs VI: on several representations of graphs by relational structures
inferred← citeshttps://doi.org/10.1016/0168-0072(90)90027-yopenalex-snapshot
The monadic second-order logic of graphs IV: definability properties of equational graphs11This work has been supported by the “Programme de Recherches Coordonnées: Mathématiques et Informatique”, and by the ESPRIT-Basic Research Action contract No. 3299, “Computing by graph transformations”.
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(51)90009-6openalex-snapshot
Recursive queries and context-free graph grammars
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90102-2openalex-snapshot
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
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)90183-3openalex-snapshot
Hypermap rewriting: a combinatorial approach
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(91)90353-4openalex-snapshot
Modular tree transducers
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90387-hopenalex-snapshot
The monadic second-order logic of graphs V: on closing the gap between definability and recognizability
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(92)90182-fopenalex-snapshot
Conditional rewriting logic as a unified model of concurrency
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)90290-aopenalex-snapshot
Separating k-separated eNCE graph languages
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)00007-0openalex-snapshot
Confluence for graph transformations
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/0890-5401(90)90038-jopenalex-snapshot
A comparison of boundary graph grammars and context-free hypergraph grammars
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90043-hopenalex-snapshot
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
inferred← citeshttps://doi.org/10.1016/b978-0-12-046370-1.50009-7openalex-snapshot
On Recognizable Sets and Tree Automata
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50010-xopenalex-snapshot
Graph Rewriting: An Algebraic and Logic Approach
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.073openalex-snapshot
Graph decompositions for cartesian products
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.ic.2015.04.005openalex-snapshot
The generative power of delegation networks
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104774openalex-snapshot
Weighted parsing for grammar-based language models over multioperator monoids
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.2022.100845openalex-snapshot
Unification of drags and confluence of drag rewriting
inferred← citeshttps://doi.org/10.1016/j.jvlc.2012.10.002openalex-snapshot
Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.019openalex-snapshot
Treewidth and logical definability of graph products
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.2018.03.014openalex-snapshot
Multiple context-free tree grammars: Lexicalization and characterization
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.2022.03.036openalex-snapshot
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
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/s0304-3975(00)00200-0openalex-snapshot
Node rewriting in graphs and hypergraphs: a categorical framework
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00285-1openalex-snapshot
L(A)=L(B)? decidability results from complete formal systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00190-4openalex-snapshot
Independent parallelism in finite copying parallel rewriting systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00212-0openalex-snapshot
Power properties of NLC graph grammars with a polynomial membership problem
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/s0304-3975(97)00263-6openalex-snapshot
Nondeterministic operations on finite relational structures
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00258-3openalex-snapshot
HRNCE grammars — a hypergraph generating system with an eNCE way of 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)80309-3openalex-snapshot
A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting
inferred← citeshttps://doi.org/10.1017/s0960129500000359openalex-snapshot
Recognizable sets of graphs: equivalent definitions and closure properties
inferred← citeshttps://doi.org/10.1017/s0960129500000621openalex-snapshot
Completeness of category-based equational deduction
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/s0960129501003565openalex-snapshot
Fusion in relational structures and the verification of monadic second-order properties
inferred← citeshttps://doi.org/10.1017/s0960129512000096openalex-snapshot
The monoidal structure of Turing machines
inferred← citeshttps://doi.org/10.1017/s096012951800018xopenalex-snapshot
Recognizable languages of arrows and cospans
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: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.1051/ita/1992260302571openalex-snapshot
The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
inferred← citeshttps://doi.org/10.1051/ita:2001122openalex-snapshot
Automata-based Representations for Infinite Graphs
inferred← citeshttps://doi.org/10.1080/00207169508804418openalex-snapshot
Algebraic structures of directed acyclic graphs: application to concurrent calculus
inferred← citeshttps://doi.org/10.1080/09528139308953776openalex-snapshot
Graph decompositions and tree automata in reasoning with uncertainty
inferred← citeshttps://doi.org/10.1109/edoc.1998.723247openalex-snapshot
Transformation rules based on meta-modeling
inferred← citeshttps://doi.org/10.1109/iceccs54210.2022.00030openalex-snapshot
DLGR: A Rule-Based Approach to Graph Replacement for Deep Learning
inferred← citeshttps://doi.org/10.1109/icee.2010.351openalex-snapshot
A Graph-Based Square Grids Generating Mechanism
inferred← citeshttps://doi.org/10.1109/lics.1990.113745openalex-snapshot
On the expression of monadic second-order graph properties without quantifications over sets of edges
inferred← citeshttps://doi.org/10.1109/secon.1992.202325openalex-snapshot
On polynomial time algorithms for tree-decomposable graphs
inferred← citeshttps://doi.org/10.1142/9789812384720_0002openalex-snapshot
HYPEREDGE REPLACEMENT GRAPH GRAMMARS
inferred← citeshttps://doi.org/10.1145/174147.169807openalex-snapshot
An algebraic theory of graph reduction
inferred← citeshttps://doi.org/10.1145/3586050openalex-snapshot
Exact Recursive Probabilistic Programming
inferred← citeshttps://doi.org/10.1145/503032.503036openalex-snapshot
From checking to inference via driving and dag grammars
inferred← citeshttps://doi.org/10.1145/509799.503036openalex-snapshot
From checking to inference via driving and dag grammars
inferred← citeshttps://doi.org/10.1145/944705.944716openalex-snapshot
Iterative-free program analysis
inferred← citeshttps://doi.org/10.1145/944746.944716openalex-snapshot
Iterative-free program analysis
inferred← citeshttps://doi.org/10.11606/t.45.2008.tde-27102008-100359openalex-snapshot
Geração de expressões algébricas para processos de negócio usando reduções de digrafos série-paralelo
inferred← citeshttps://doi.org/10.1162/coli_a_00309openalex-snapshot
Weighted DAG Automata for Semantic Graphs
inferred← citeshttps://doi.org/10.1162/coli_a_00488openalex-snapshot
Generation and Polynomial Parsing of Graph Languages with Non-Structural Reentrancies
inferred← citeshttps://doi.org/10.14232/phd.11681openalex-snapshot
Weighted Tree Generating Regular Systems and Crisp-Determinization of Weighted Tree Automata
showing the first 200 of 220 · page through all 220
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.