𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The dissecting power of regular languages

✍ Scribed by Yamakami, Tomoyuki; Kato, Yuichi

Book ID
123144185
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
212 KB
Volume
113
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Power-separating regular languages
Power-separating regular languages
✍ H. J. Shyr; G. Thierrin πŸ“‚ Article πŸ“… 1974 πŸ› Springer 🌐 English βš– 430 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) βˆͺ

The limited regular languages
The limited regular languages
✍ Chang-jie Tang; Yi-li Zhang πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 621 KB
Generators of regular languages
Generators of regular languages
✍ V. N. Red'ko; L. P. Lisovik πŸ“‚ Article πŸ“… 1980 πŸ› Springer US 🌐 English βš– 520 KB