Graph expressions and graph rewritings
From MaRDI portal
Recommendations
Cites work
- Algebraic automata and context-free sets
- Algebraic characterization of reducible flowcharts
- Automata in general algebras
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Fundamental properties of infinite trees
- Graph grammars and automata (survey)
- scientific article; zbMATH DE number 3888893 (Why is no real title available?)
- scientific article; zbMATH DE number 4049097 (Why is no real title available?)
- scientific article; zbMATH DE number 4049098 (Why is no real title available?)
- scientific article; zbMATH DE number 4051026 (Why is no real title available?)
- scientific article; zbMATH DE number 3512082 (Why is no real title available?)
- scientific article; zbMATH DE number 3549200 (Why is no real title available?)
- scientific article; zbMATH DE number 3607504 (Why is no real title available?)
- Infinite hypergraphs. II: Systems of recursive equations
- Initial Algebra Semantics and Continuous Algebras
- IO and OI. I
- On graph rewritings
- Pushout-Properties: An analysis of gluing constructions for graphs
- Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation
- Transformations of structures: An algebraic approach
- Two Families of Languages Related to ALGOL
Cited in
(only showing first 100 items - show all)- Treewidth and logical definability of graph products
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Power properties of NLC graph grammars with a polynomial membership problem
- The string generating power of context-free hypergraph grammars
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- Hypermap rewriting: A combinatorial approach
- Algorithms for recognition of regular properties and decomposition of recursive graph families
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Conditional rewriting logic as a unified model of concurrency
- The monadic second-order logic of graphs. VII: Graphs as relational structures
- Infinite hypergraphs. II: Systems of recursive equations
- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- Trading independent for synchronized parallelism in finite copying parallel rewriting systems
- The equivalence of bottom-up and top-down tree-to-graph transducers
- A partial k-arboretum of graphs with bounded treewidth
- Nondeterministic operations on finite relational structures
- On hyperedge replacement and BNLC graph grammars
- Separating \(k\)-separated eNCE graph languages
- Hypergraph languages of bounded degree
- Monadic second-order definable graph transductions: a survey
- The complexity of connectivity problems on context-free graph languages
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- The translation power of top-down tree-to-graph transducers
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Synthesized and inherited functions. A new computational model for syntax-directed semantics
- Probabilistic hyperedge replacement grammars
- The obstructions of a minor-closed set of graphs defined by a context-free grammar
- Logical description of context-free graph languages
- \(L(A)=L(B)\)? decidability results from complete formal systems
- Multiple context-free tree grammars: lexicalization and characterization
- A comparison of compatible, finite, and inductive graph properties
- Infinite hypergraphs. I: Basic properties
- The monadic second-order logic of graphs. VIII: Orientations
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- Independent parallelism in finite copying parallel rewriting systems
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
- Weighted parsing for grammar-based language models over multioperator monoids
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
- The complexity of graph languages generated by hyperedge replacement
- Handle-rewriting hypergraph grammars
- Constraint relaxation may be perfect
- Drags: a compositional algebraic framework for graph rewriting
- Graph transformation for incremental natural language analysis
- Recognizability of graph and pattern languages
- A general framework for types in graph rewriting
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Uniform parsing for hyperedge replacement grammars
- Unification of drags and confluence of drag rewriting
- Causality in bounded Petri nets is MSO definable
- Reachability in graph transformation systems and slice languages
- Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models
- Selected Decision Problems for Square-Refinement Collage Grammars
- Graph decompositions for cartesian products
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width
- From Tree-Based Generators to Delegation Networks
- scientific article; zbMATH DE number 4049096 (Why is no real title available?)
- scientific article; zbMATH DE number 4049097 (Why is no real title available?)
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- scientific article; zbMATH DE number 517053 (Why is no real title available?)
- Recognizable sets of graphs: equivalent definitions and closure properties
- Graph decompositions and tree automata in reasoning with uncertainty
- Automata-based Representations for Infinite Graphs
- Recognizable languages of arrows and cospans
- scientific article; zbMATH DE number 7020157 (Why is no real title available?)
- The contractum in algebraic graph rewriting
- A category-theoretical approach to vertex replacement: the generation of infinite graphs
- Graph unification and matching
- The use of tree transducers to compute translations between graph algebras
- Process specification and verification
- The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed
- Concatenation of graphs
- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting
- A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths
- scientific article; zbMATH DE number 4114059 (Why is no real title available?)
- scientific article; zbMATH DE number 809155 (Why is no real title available?)
- Algebraic structures of directed acyclic graphs: application to concurrent calculus
- The monoidal structure of Turing machines
- Hyperedge replacement with rendezvous
- Extending graph rewriting with copying
- Graph-grammar semantics of a higher-order programming language for distributed systems
- Graphs and designing
- Set-theoretic graph rewriting
- On relating rewriting systems and graph grammars to event structures
- An introduction to category-based equational logic
- scientific article; zbMATH DE number 7204410 (Why is no real title available?)
- \(k\)-best solutions of MSO problems on tree-decomposable graphs
- A Greibach normal form for context-free graph grammars
- Graph rewriting for the π-calculus
- Separation results for separated apex NLC and NCE graph languages
- Node rewriting in graphs and hypergraphs: A categorical framework
- Maximum flows in parametric graph templates
- Monoidal Width
- Rewriting logic as a semantic framework for concurrency: a progress report
- A uniform approach to graph rewriting: The pullback approach
- Monoidal Width: Capturing Rank Width
- On systems of equations defining infinite graphs
- The monadic second-order logic of graphs : Definable sets of finite graphs
- Synthesis and Analysis of Petri Nets from Causal Specifications
This page was built for publication: Graph expressions and graph rewritings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3782818)
