๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Decidability of Hierarchies of Regular Aperiodic Languages

โœ Scribed by V.L. Selivanov

Book ID
110402019
Publisher
Springer US
Year
2002
Tongue
English
Weight
255 KB
Volume
41
Category
Article
ISSN
0002-5232

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Decidability of the consistency problem
Decidability of the consistency problem for regular symbolic picture description languages
โœ 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.