✦ LIBER ✦

Regular patterns, regular languages and context-free languages

✍ Scribed by Sanjay Jain; Yuh Shin Ong; Frank Stephan

Book ID: 108154722
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 164 KB
Volume: 110
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2010.09.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Detecting patterns in finite regular and

Detecting patterns in finite regular and context-free languages

✍ Narad Rampersad; Jeffrey Shallit 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 164 KB

On regularity of context-free languages

✍ A. Ehrenfeucht; D. Haussler; G. Rozenberg 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 112 KB

Regular autodense languages

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

Efficient constructions of test sets for

Efficient constructions of test sets for regular and context-free languages

✍ Juhani Karhuma¨ki; Wojciech Rytter; Stefan Jarominek 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 799 KB

Classes of regular and context-free lang

Classes of regular and context-free languages over countably infinite alphabets

✍ Friedrich Otto 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 747 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) ∪