Pages that link to "Item:Q4379556"
From MaRDI portal
The following pages link to Handbook of Graph Grammars and Computing by Graph Transformation (Q4379556):
Displaying 50 items.
- Navigating the chemical space of HCN polymerization and hydrolysis: guiding graph grammars by mass spectrometry data (Q280605) (← links)
- Prosperity is associated with instability in dynamical networks (Q289450) (← links)
- Configuration logics: modeling architecture styles (Q347359) (← links)
- Amalgamation of domain specific languages with behaviour (Q347380) (← links)
- Connectivity games over dynamic networks (Q391110) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- Decomposition width of matroids (Q415290) (← links)
- Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs (Q418014) (← links)
- Modelling evolution of communication platforms and scenarios based on transformations of high-level nets and processes (Q418764) (← links)
- Polynomial graph transformability (Q418788) (← links)
- Correct transformation: from object-based graph grammars to PROMELA (Q436353) (← links)
- Verification of graph grammars using a logical approach (Q436370) (← links)
- On the directed full degree spanning tree problem (Q456701) (← links)
- Graphical and incremental type inference. A graph transformation approach (Q526459) (← links)
- Translating controlled graph grammars to ordinary graph grammars (Q529641) (← links)
- Algebraic hierarchical graph transformation (Q596311) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- A decentralised graphical implementation of mobile ambients (Q624388) (← links)
- Graph grammars with string-regulated rewriting (Q652154) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- 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)
