𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Commutative closure of regular semigroups of languages

✍ Scribed by M. S. L'vov


Publisher
Springer US
Year
1975
Tongue
English
Weight
444 KB
Volume
9
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Regular component decomposition of regul
✍ 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) βˆͺ