Regular autodense languages
β Scribed by Chen-Ming Fan; C. C. Huang; H. J. Shyr
- Publisher
- Springer-Verlag
- Year
- 2008
- Tongue
- English
- Weight
- 177 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0001-5903
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) βͺ
In this note, we consider the problem of learning approximately regular languages in the limit from positive data using the class of k-reversible languages. The class of k-reversible languages was introduced by Angluin (1982), and proved to be efficiently identifiable in the limit from positive data
The square of a language L is the set of all words pp where p β L. The square of a regular language may be regular too or context-free or none of both. We give characterizations for each of these cases and show that it is decidable whether a regular language has one of these properties.