𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Model-Checking of Infinite Graphs Defined by Graph Grammars

✍ Scribed by Olaf Burkart; Yves-Marie Quemener

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
31 KB
Volume
5
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Graphs defined by coverings of a set
Graphs defined by coverings of a set
✍ R. K. Guy; E. C. Milner πŸ“‚ Article πŸ“… 1968 πŸ› Akadmiai Kiad 🌐 English βš– 703 KB