避免上5个字母的共轭课

RAIRO Theor. Informatics Appl. Pub Date : 2018-11-20 DOI:10.1051/ita/2020003

Golnaz Badkobeh, Pascal Ochem

{"title":"避免上5个字母的共轭课","authors":"Golnaz Badkobeh, Pascal Ochem","doi":"10.1051/ita/2020003","DOIUrl":null,"url":null,"abstract":"We construct an infinite word w over the 5-letter alphabet such that for every factor f of w of length at least two, there exists a cyclic permutation of f that is not a factor of w. In other words, w does not contain a non-trivial conjugacy class. This proves the conjecture in Gamard et al. [Theoret. Comput. Sci. 726 (2018) 1–4].","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Avoiding conjugacy classes on the 5-letter alphabet\",\"authors\":\"Golnaz Badkobeh, Pascal Ochem\",\"doi\":\"10.1051/ita/2020003\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We construct an infinite word w over the 5-letter alphabet such that for every factor f of w of length at least two, there exists a cyclic permutation of f that is not a factor of w. In other words, w does not contain a non-trivial conjugacy class. This proves the conjecture in Gamard et al. [Theoret. Comput. Sci. 726 (2018) 1–4].\",\"PeriodicalId\":438841,\"journal\":{\"name\":\"RAIRO Theor. Informatics Appl.\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"RAIRO Theor. Informatics Appl.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1051/ita/2020003\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"RAIRO Theor. Informatics Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ita/2020003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们在5个字母的字母表上构造一个无限的单词w，使得对于w的每个长度至少为2的因子f，存在一个不是w的因子f的循环置换。换句话说，w不包含非平凡共轭类。这证明了Gamard et al. [theory]中的猜想。第一版。科学通报，2018(2):1-4。

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

查看原文本刊更多论文

Avoiding conjugacy classes on the 5-letter alphabet

We construct an infinite word w over the 5-letter alphabet such that for every factor f of w of length at least two, there exists a cyclic permutation of f that is not a factor of w. In other words, w does not contain a non-trivial conjugacy class. This proves the conjecture in Gamard et al. [Theoret. Comput. Sci. 726 (2018) 1–4].

求助全文

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

来源期刊

RAIRO Theor. Informatics Appl.

自引率

0.00%

发文量