密集语言与非原始词

IF 0.3 Q4 COMPUTER SCIENCE, CYBERNETICS

Acta Cybernetica Pub Date : 2022-03-01 DOI:10.14232/actacyb.293457

T. Koga

{"title":"密集语言与非原始词","authors":"T. Koga","doi":"10.14232/actacyb.293457","DOIUrl":null,"url":null,"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.","PeriodicalId":42512,"journal":{"name":"Acta Cybernetica","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dense Languages and Non Primitive Words\",\"authors\":\"T. Koga\",\"doi\":\"10.14232/actacyb.293457\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":42512,\"journal\":{\"name\":\"Acta Cybernetica\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2022-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Cybernetica\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14232/actacyb.293457\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, CYBERNETICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Cybernetica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14232/actacyb.293457","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们关注的是密集语言和非原始词。如果可以找到任何字符串作为L元素的子字符串，则称L语言是稠密的。2020年，Ryoma Syn'ya证明了任何具有正渐近密度的正则语言总是包含有限多个非原始词。由于正渐近密度意味着密度，所以很自然地会问他的结果是否可以推广到更广泛的一类稠密语言。在本文中，我们实际上得到了这样的推广。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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-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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Acta Cybernetica COMPUTER SCIENCE, CYBERNETICS-

CiteScore

1.10

自引率

0.00%

发文量

期刊介绍： Acta Cybernetica publishes only original papers in the field of Computer Science. Manuscripts must be written in good English.