✦ LIBER ✦

The limited regular languages

✍ Scribed by Chang-jie Tang; Yi-li Zhang

Book ID: 107948592
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 621 KB
Volume: 23
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(88)90005-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regular patterns, regular languages and

Regular patterns, regular languages and context-free languages

✍ Sanjay Jain; Yuh Shin Ong; Frank Stephan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Regular probabilistic languages

✍ Eugene S. Santos 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 506 KB

Regular autodense languages

✍ Chen-Ming Fan; C. C. Huang; H. J. Shyr 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 177 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) ∪

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

Power-separating regular languages

✍ H. J. Shyr; G. Thierrin 📂 Article 📅 1974 🏛 Springer 🌐 English ⚖ 430 KB