✦ LIBER ✦

Decidability of the consistency problem for regular symbolic picture description languages

✍ Scribed by G. Costagliola; V. Deufemia; F. Ferrucci; C. Gravino

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 86 KB
Volume: 80
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(01)00154-5

No coin nor oath required. For personal study only.

✦ Synopsis

In the paper we address the consistency problem for drawn symbolic picture grammars. In particular we prove that it is always possible to decide whether or not a regular grammar generates only consistent descriptions of drawn symbolic pictures.