✦ LIBER ✦

Regular probabilistic languages

✍ Scribed by Eugene S. Santos

Book ID: 114037009
Publisher: Elsevier Science
Year: 1973
Weight: 506 KB
Volume: 23
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(73)90895-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On weak regular probabilistic languages

✍ Eugene S. Santos 📂 Article 📅 1975 🏛 Elsevier Science ⚖ 236 KB

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

Concise representations of regular langu

Concise representations of regular languages by degree and probabilistic finite automata

✍ Chandra M. R. Kintala; Kong -Yee Pun; Detlef Wotschke 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 744 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) ∪

Probabilistic Grammars and Languages

✍ András Kornai 📂 Article 📅 2011 🏛 Springer Netherlands 🌐 English ⚖ 191 KB