{"title":"形态序列：复杂性与可判定性","authors":"Raphael HenryI2M, Aix-Marseille Université","doi":"arxiv-2406.16406","DOIUrl":null,"url":null,"abstract":"In this work we recall Pansiot's result on the complexity of pure morphic\nsequences and we use the tools developed by Devyatov for morphic sequences to\nprove the decidability of the complexity class of pure morphic sequences.","PeriodicalId":501216,"journal":{"name":"arXiv - CS - Discrete Mathematics","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Morphic Sequences: Complexity and Decidability\",\"authors\":\"Raphael HenryI2M, Aix-Marseille Université\",\"doi\":\"arxiv-2406.16406\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we recall Pansiot's result on the complexity of pure morphic\\nsequences and we use the tools developed by Devyatov for morphic sequences to\\nprove the decidability of the complexity class of pure morphic sequences.\",\"PeriodicalId\":501216,\"journal\":{\"name\":\"arXiv - CS - Discrete Mathematics\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2406.16406\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.16406","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this work we recall Pansiot's result on the complexity of pure morphic
sequences and we use the tools developed by Devyatov for morphic sequences to
prove the decidability of the complexity class of pure morphic sequences.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
