𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complete Classifications for the Communication Complexity of Regular Languages

✍ Scribed by Pascal Tesson; Denis Thérien

Publisher
Springer
Year
2004
Tongue
English
Weight
289 KB
Volume
38
Category
Article
ISSN
1433-0490

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.