𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Circuit Complexity of Regular Languages

✍ Scribed by Michal Koucký

Publisher
Springer
Year
2009
Tongue
English
Weight
316 KB
Volume
45
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regular component decomposition of regul
Regular component decomposition of regular languages
✍ Y.J. Liu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 198 KB

A language is regular if it can be recognized by a ÿnite automaton. According to the pumping lemma, every inÿnite regular language contains a regular subset of the form uv + w, where u; v; w are words and v is not empty. It is known that every regular language can be expressed as ( i∈I uiv + i wi) ∪

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.