Context-free graph grammars and concatenation of graphs

DOI10.1007/s002360050106zbMath0896.68092OpenAlexW2125616765MaRDI QIDQ1386441

Jan Joris Vereijken, Joost Engelfriet

Publication date: 1 October 1998

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/contextfree-graph-grammars-and-concatenation-of-graphs(c7be526a-d36f-4011-9986-ff86cb96a8c0).html

zbMATH Keywords

concatenationgraph languagesstring languagesHR grammars

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Related Items (16)

Reachability in Graph Transformation Systems and Slice Languages ⋮ Towards more precise rewriting approximations ⋮ Fixpoint logics over hierarchical structures ⋮ The Syntactic Complexity of Eulerian Graphs ⋮ Syntactic recognizability of graphs with fuzzy attributes ⋮ The expressivity of autosegmental grammars ⋮ Concatenation of graphs ⋮ Multiple context-free tree grammars: lexicalization and characterization ⋮ The monoidal structure of Turing machines ⋮ Graph automata ⋮ Recognizability of graph and pattern languages ⋮ An axiomatization of graphs ⋮ Causality in Bounded Petri Nets is MSO Definable ⋮ Origin-equivalence of two-way word transducers is in PSPACE ⋮ Graph Automata: The Algebraic Properties of Abelian Relational Graphoids ⋮ Extended multi bottom-up tree transducers

This page was built for publication: Context-free graph grammars and concatenation of graphs