A theory of regular MSC languages
β Scribed by Jesper G. Henriksen; Madhavan Mukund; K. Narayan Kumar; Milind Sohoni; P.S. Thiagarajan
- Book ID
- 113641540
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 422 KB
- Volume
- 202
- Category
- Article
- ISSN
- 0890-5401
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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) βͺ
As every non-empty word is a power of a unique primitive word, a set of primitive roots of a language is like an independent subset of a vector space. A language having finitely many primitive roots is called a local language. The purpose of this paper is to characterize local regular languages. We