✦ LIBER ✦

On morphic generation of regular languages

✍ Scribed by T. Harju; J. Karhumäki; H.C.M. Kleijn

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 292 KB
Volume: 15
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(86)90018-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on morphic characterization of la

A note on morphic characterization of languages

✍ Juhani Karhumäki; Matti Linna 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 235 KB

A morphic representation of EOL language

A morphic representation of EOL languages and other ETOL languages

✍ A. Ehrenfeucht; G. Rozenberg; K. Ruohonen 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 376 KB

On regularity of languages generated by

On regularity of languages generated by copying systems

✍ A. Ehrenfeucht; G. Rozenberg 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 304 KB

Representation theorems on regular langu

Representation theorems on regular languages

✍ K. Hashiguchi 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 1019 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) ∪