Pages that link to "Item:Q1386441"
From MaRDI portal
The following pages link to Context-free graph grammars and concatenation of graphs (Q1386441):
Displaying 17 items.
- The expressivity of autosegmental grammars (Q667923) (← links)
- An axiomatization of graphs (Q707454) (← links)
- Extended multi bottom-up tree transducers (Q1038420) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- Towards more precise rewriting approximations (Q2424681) (← links)
- Fixpoint logics over hierarchical structures (Q2429724) (← links)
- Syntactic recognizability of graphs with fuzzy attributes (Q2445984) (← links)
- Graph automata (Q2481961) (← links)
- Recognizability of graph and pattern languages (Q2491214) (← links)
- Causality in Bounded Petri Nets is MSO Definable (Q2820695) (← links)
- Reachability in Graph Transformation Systems and Slice Languages (Q2947215) (← links)
- Graph Automata: The Algebraic Properties of Abelian Relational Graphoids (Q3098038) (← links)
- The Syntactic Complexity of Eulerian Graphs (Q3522868) (← links)
- Concatenation of graphs (Q4645288) (← links)
- The monoidal structure of Turing machines (Q4917187) (← links)
- Origin-equivalence of two-way word transducers is in PSPACE (Q5090958) (← links)
- Synthesis and Analysis of Petri Nets from Causal Specifications (Q6487344) (← links)