Dense languages and non primitive words
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. In 2020, Ryoma Syn'ya proved that any regular language with positive asymptotic density always containsinfinitely many non-pr...
Elmentve itt :
| Szerző: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Cikk |
| Megjelent: |
University of Szeged, Institute of Informatics
Szeged
2022
|
| Sorozat: | Acta cybernetica
25 No. 3 |
| Kulcsszavak: | Algoritmus, Programozás |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.293457 |
| Online Access: | http://acta.bibl.u-szeged.hu/75631 |
| Tartalmi kivonat: | 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. In 2020, Ryoma Syn'ya proved that any regular language with positive asymptotic density always containsinfinitely many non-primitive words. Since positive asymptotic density implies density, it is natural to ask whether his result can be generalized for a wider class of dense languages. In this paper, we actually obtain such generalization. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 717-731 |
| ISSN: | 0324-721X |