Back to Search
Start Over
Relatively regular languages and thin codes
- Source :
-
European Journal of Combinatorics . Jan2008, Vol. 29 Issue 1, p261-267. 7p. - Publication Year :
- 2008
-
Abstract
- Abstract: A language is called a relatively regular language if its syntactic monoid has finite ideals. In this paper, we show that there are close relationships between the relatively regular languages and some other classes of languages such as (generalized) disjunctive languages, fd-domains and 2-codes. In particular, we prove that every relatively regular 2-code is thin. Thus, the well known result of Bestel and Perrin in 1985 becomes an easy corollary of our result. [Copyright &y& Elsevier]
- Subjects :
- *COMBINATORICS
*ALGEBRA
*MATHEMATICAL analysis
*MATHEMATICS
Subjects
Details
- Language :
- English
- ISSN :
- 01956698
- Volume :
- 29
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- European Journal of Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 27334180
- Full Text :
- https://doi.org/10.1016/j.ejc.2006.09.002