𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Concatenation of Regular Languages and Descriptional Complexity

✍ Scribed by Galina Jirásková

Publisher
Springer
Year
2011
Tongue
English
Weight
573 KB
Volume
49
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Squares of regular languages
Squares of regular languages
✍ Gerhard Lischke 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

The square of a language L is the set of all words pp where p ∈ L. The square of a regular language may be regular too or context-free or none of both. We give characterizations for each of these cases and show that it is decidable whether a regular language has one of these properties.

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.

The complexity of countable categoricity
The complexity of countable categoricity in finite languages
✍ Aleksander Ivanov 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

## Abstract We study complexity of the index set of countably categorical theories and Ehrenfeucht theories in finite languages.