𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A characterization of local regular languages

✍ Scribed by S.S. Yu

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
458 KB
Volume
184
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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 show that whether a regular language is local or not is decidable. In the meanwhile, two characterizations of local regular languages are derived. (~

πŸ“œ SIMILAR VOLUMES

LANGAGE: A maple package for automaton c
LANGAGE: A maple package for automaton characterization of regular languages
✍ Pascal Caron πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 95 KB

LANGAGE is a set of procedures for deciding whether or not a language given by its minimal automaton is piecewise testable, locally testable, strictly locally testable, or strongly locally testable. New polynomial algorithms are implemented for the two last properties. This package is written using

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) βˆͺ