✦ LIBER ✦

Generators of regular languages

✍ Scribed by V. N. Red'ko; L. P. Lisovik

Publisher: Springer US
Year: 1980
Tongue: English
Weight: 520 KB
Volume: 15
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01075089

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Regular autodense languages

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

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.

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

Learning approximately regular languages

Learning approximately regular languages with reversible languages

✍ Satoshi Kobayashi; Takashi Yokomori 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 490 KB

In this note, we consider the problem of learning approximately regular languages in the limit from positive data using the class of k-reversible languages. The class of k-reversible languages was introduced by Angluin (1982), and proved to be efficiently identifiable in the limit from positive data