✦ LIBER ✦

Odometers on Regular Languages

✍ Scribed by Valérie Berthé; Michel Rigo

Publisher: Springer
Year: 2005
Tongue: English
Weight: 431 KB
Volume: 40
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-005-1215-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Representation theorems on regular langu

Representation theorems on regular languages

✍ K. Hashiguchi 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 1019 KB

Regular autodense languages

✍ Chen-Ming Fan; C. C. Huang; H. J. Shyr 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 177 KB

A note on ω-regular languages

✍ Masako Takahashi; Hideki Yamasaki 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 647 KB

On morphic generation of regular languag

On morphic generation of regular languages

✍ T. Harju; J. Karhumäki; H.C.M. Kleijn 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 292 KB

On the entropy of regular languages

✍ Tullio Ceccherini-Silberstein; Antonio Machı̀; Fabio Scarabotti 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 422 KB

Then the entropy decreases strictly: ent(L W ) ¡ ent(L). In this note we present a new proof of this fact, based on a method of Gromov, which avoids the Perron-Frobenius theory. This result applies to the regular languages of ÿnitely generated free groups and an additional application is presented.

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) ∪