Dense Languages and Non Primitive Words.

Autor: Koga, Toshihiro
Předmět:
Zdroj: Acta Cybernetica; 2022, Vol. 25 Issue 3, p717-731, 15p
Abstrakt: In this paper, we are concerned with dense languages and non primitive words. A language L is said to be dense if any string can be found as a substring of element of L. It is known that if a regular language R is dense, then R contains infinitely many non-primitive words. Then it is natural to ask whether this result can be generalized for a wider class of dense languages. In this paper, we actually obtain such generalization. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index