𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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 note on autodense related languages
✍ Chen-Ming Fan; C. C. Huang; H. J. Shyr; Kuo-Hsiang Chen πŸ“‚ Article πŸ“… 2010 πŸ› Springer-Verlag 🌐 English βš– 173 KB
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) βˆͺ

Learning approximately regular languages
✍ Satoshi Kobayashi; Takashi Yokomori πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 490 KB

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

Squares of regular languages
✍ Gerhard Lischke πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 127 KB

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.

Power-separating regular languages
✍ H. J. Shyr; G. Thierrin πŸ“‚ Article πŸ“… 1974 πŸ› Springer 🌐 English βš– 430 KB
Generators of regular languages
✍ V. N. Red'ko; L. P. Lisovik πŸ“‚ Article πŸ“… 1980 πŸ› Springer US 🌐 English βš– 520 KB