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.
- Graph automata: Natural expression of self-reproduction (Q700838) (← links)
- Well-structured graph transformation systems (Q729812) (← links)
- Framework and authoring tool for an extension of the UIML language (Q733277) (← links)
- Constant delay traversal of grammar-compressed graphs with bounded rank (Q776844) (← 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)
- The generative power of delegation networks (Q897662) (← links)
- Graph grammars, insertion Lie algebras, and quantum field theory (Q904526) (← 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)
- Linear delay enumeration and monadic second-order logic (Q967312) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Reasoning with graph constraints (Q973044) (← links)
- An algebraic semantics for MOF (Q973052) (← links)
- Packing disjoint cycles over vertex cuts (Q973127) (← links)
- Adaptive star grammars and their languages (Q986544) (← links)
- On the reachability of a version of graph-rewriting system (Q989484) (← 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)
- Recognizing optimal 1-planar graphs in linear time (Q1702117) (← links)
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (Q1730221) (← links)
- The PBPO graph transformation approach (Q1734525) (← links)
- Reachability analysis of reversal-bounded automata on series-parallel graphs (Q1741900) (← links)
- Grammatical inference of directed acyclic graph languages with polynomial time complexity (Q1747486) (← links)
- Grammar-based model transformations: definition, execution, and quality properties (Q1749124) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← 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)