Decidability of the consistency problem
β
G. Costagliola; V. Deufemia; F. Ferrucci; C. Gravino
π
Article
π
2001
π
Elsevier Science
π
English
β 86 KB
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.