✦ LIBER ✦

Word-paired catenations of regular languages

✍ Scribed by H.K. Hsiao; S.S. Yu; Yu-Kuang Zhao

Book ID: 108113446
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 232 KB
Volume: 287
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.04.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ordered catenation and regular free disj

Ordered catenation and regular free disjunctive languages

✍ H.J. Shyr 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 478 KB

Regular languages of partial words

✍ Dassow, Jürgen; Manea, Florin; Mercaş, Robert 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 441 KB

A note on word chains and regular langua

A note on word chains and regular languages

✍ Peter Roth 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 517 KB

Fuzzy regular languages over finite and

Fuzzy regular languages over finite and infinite words

✍ Werner Kuich; George Rahonis 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 301 KB

Regular expression for a language withou

Regular expression for a language without empty word

✍ Djelloul Ziadi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 373 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) ∪