Pages that link to "Item:Q4379556"
From MaRDI portal
The following pages link to Handbook of Graph Grammars and Computing by Graph Transformation (Q4379556):
Displayed 50 items.
- Algebraic hierarchical graph transformation (Q596311) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Graph automata: Natural expression of self-reproduction (Q700838) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Average case analysis of DJ graphs (Q866551) (← links)
- Unfolding semantics of graph transformation (Q879600) (← links)
- Can abstract state machines be useful in language theory? (Q880169) (← links)
- Subobject transformation systems (Q934672) (← links)
- A framework for the verification of infinite-state graph transformation systems (Q937301) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Polarity of chordal graphs (Q955313) (← links)
- Treewidth and logical definability of graph products (Q1006041) (← links)
- Graph transformations for object-oriented refinement (Q1019019) (← links)
- The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) (← links)
- Nondeterministic operations on finite relational structures (Q1276248) (← links)
- The generating power of total deterministic tree transducers (Q1281500) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- A monadic second-order definition of the structure of convex hypergraphs. (Q1400707) (← links)
- Criteria to disprove context freeness of collage languages. (Q1401171) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- Query efficient implementation of graphs of bounded clique-width (Q1408820) (← links)
- The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings (Q1575704) (← links)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
- Hierarchical graph transformation (Q1608318) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- Macro tree transducers, attribute grammars, and MSO definable tree translations. (Q1854312) (← links)
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
- Reducibility between classes of port graph grammar. (Q1872703) (← links)
- Node replacements in embedding normal form. (Q1872709) (← links)
- Automatic graphs and D0L-sequences of finite graphs (Q1877692) (← links)
- Clustering for Petri nets (Q1884880) (← links)
- Graph traversal and graph transformation (Q1885899) (← links)
- The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs (Q1960417) (← links)
- Upper bounds to the clique width of graphs (Q1975365) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Graph automata (Q2481961) (← links)
- Algebraic recognizability of regular tree languages (Q2484441) (← links)
- The uniqueness condition for the double pushout transformation of algebras (Q2486006) (← links)
- Graph-based specification of access control policies (Q2486563) (← links)
- The monadic second-order logic of graphs. XV: On a conjecture by D. Seese (Q2494727) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Quantitative \(\mu\)-calculus and CTL defined over constraint semirings (Q2576952) (← links)
- A general framework for types in graph rewriting (Q2581012) (← links)
- Graph decompositions definable in monadic second-order logic (Q3439302) (← links)
- Graph decompositions for cartesian products (Q3439368) (← links)
- Towards a component framework for architecture-based self-adaptive applications (Q3446010) (← links)
- Ugo Montanari and Graph Transformation (Q3507353) (← links)