𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Formulas, regular languages and boolean circuits

✍ Scribed by Pierre Péladeau

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
701 KB
Volume
101
Category
Article
ISSN
0304-3975

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.