注意循环词中因子的出现

RAIRO Theor. Informatics Appl. Pub Date : 2016-04-01 DOI:10.1051/ita/2016019

P. Arnoux

{"title":"注意循环词中因子的出现","authors":"P. Arnoux","doi":"10.1051/ita/2016019","DOIUrl":null,"url":null,"abstract":"We give an elementary proof of a property discovered by Xavier Grandsart: let W be a circular binary word; then the differences in the number of occurrences |W |0011 − |W |1100 , |W |1101 − |W |1011 , |W |1010 − |W |0101 and |W |0100 − |W |0010 are equal; this property is easily generalized using the De Bruijn graph.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"337 8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Note on occurrences of factors in circular words\",\"authors\":\"P. Arnoux\",\"doi\":\"10.1051/ita/2016019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give an elementary proof of a property discovered by Xavier Grandsart: let W be a circular binary word; then the differences in the number of occurrences |W |0011 − |W |1100 , |W |1101 − |W |1011 , |W |1010 − |W |0101 and |W |0100 − |W |0010 are equal; this property is easily generalized using the De Bruijn graph.\",\"PeriodicalId\":438841,\"journal\":{\"name\":\"RAIRO Theor. Informatics Appl.\",\"volume\":\"337 8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"RAIRO Theor. Informatics Appl.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1051/ita/2016019\",\"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/2016019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们给出了Xavier Grandsart发现的一个性质的初等证明:设W是一个循环二进制词;则出现次数差值|W |0011−|W |1100、|W |1101−|W |1011、|W |1010−|W |0101和|W |0100−|W |0010相等;这个性质很容易用德布鲁因图推广。

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

查看原文本刊更多论文

Note on occurrences of factors in circular words

We give an elementary proof of a property discovered by Xavier Grandsart: let W be a circular binary word; then the differences in the number of occurrences |W |0011 − |W |1100 , |W |1101 − |W |1011 , |W |1010 − |W |0101 and |W |0100 − |W |0010 are equal; this property is easily generalized using the De Bruijn graph.

求助全文

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

来源期刊

RAIRO Theor. Informatics Appl.

自引率

0.00%

发文量