Dense languages and non primitive words

Koga Toshihiro: Dense languages and non primitive words. In: Acta cybernetica, (25) 3. pp. 717-731. (2022)

Cikk, tanulmány, mű cybernetica_025_numb_003_717-731.pdf Download (283kB)

Abstract

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.

Item Type:	Article
Journal or Publication Title:	Acta cybernetica
Date:	2022
Volume:	25
Number:	3
ISSN:	0324-721X
Page Range:	pp. 717-731
Language:	English
Publisher:	University of Szeged, Institute of Informatics
Place of Publication:	Szeged
Event Title:	Conference of PhD Students in Computer Science (12.) (2020) (Szeged)
Related URLs:	http://acta.bibl.u-szeged.hu/75566/
DOI:	10.14232/actacyb.293457
Uncontrolled Keywords:	Algoritmus, Programozás
Additional Information:	Bibliogr.: p. 730-731. ; összefoglalás angol nyelven
Subjects:	01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences
Date Deposited:	2022. May. 13. 10:20
Last Modified:	2022. May. 13. 10:20
URI:	http://acta.bibl.u-szeged.hu/id/eprint/75631

Actions (login required)

View Item