✦ LIBER ✦

Context-free graph grammars and concatenation of graphs

✍ Scribed by Joost Engelfriet; Jan Joris Vereijken

Book ID: 105931038
Publisher: Springer-Verlag
Year: 1997
Tongue: English
Weight: 333 KB
Volume: 34
Category: Article
ISSN: 0001-5903
DOI: 10.1007/s002360050106

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized context-free grammars and mu

Generalized context-free grammars and multiple context-free grammars

✍ Tadao Kasami; Hiroyuki Seki; Mamoru Fujii 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 808 KB

Context-free pairs of groups I: Context-

Context-free pairs of groups I: Context-free pairs and graphs

✍ Tullio Ceccherini-Silberstein; Wolfgang Woess 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 460 KB

Logical Description of Context-free Grap

Logical Description of Context-free Graph Languages

✍ Joost Engelfriet; Vincent van Oostrom 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 378 KB

The obstructions of a minor-closed set o

The obstructions of a minor-closed set of graphs defined by a context-free grammar

✍ B Courcelle; G Sénizergues 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 979 KB

We establish that the finite set of obstructions of a minor-closed set of graphs given by a hyperedge replacement grammar can be effectively constructed. Our proof uses an auxiliary result stating that the system of equations associated with a proper hyperedge replacement grammar has a unique soluti

Logic hypergraph grammars and context-fr

Logic hypergraph grammars and context-free hypergraph grammars

✍ Isamu Shioya; Katsuhiko Nakamura 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 711 KB

Model-Checking of Infinite Graphs Define

Model-Checking of Infinite Graphs Defined by Graph Grammars

✍ Olaf Burkart; Yves-Marie Quemener 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 31 KB