{"title":"Sofic的动态变化","authors":"Ali Akbar Kamaludheen","doi":"10.17993/3ctecno.2022.v11n2e42.13-23","DOIUrl":null,"url":null,"abstract":"In this paper, we provide a characterization for the subshifts of finite type (SFT) in terms of Cellular automata (CA). In addition, we prove that 1. The following are equivalent for a non-singleton subshift of finite type XF. a) XF is transitive and Per(XF), the set of periodic points of XF, is cofinite b) XF is weak mixing c) XF is mixing. 2. For non-singleton sofic shifts, only the statements (a) and (b) are equivalent.","PeriodicalId":210685,"journal":{"name":"3C Tecnología_Glosas de innovación aplicadas a la pyme","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Dynamics of Sofic Shifts\",\"authors\":\"Ali Akbar Kamaludheen\",\"doi\":\"10.17993/3ctecno.2022.v11n2e42.13-23\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we provide a characterization for the subshifts of finite type (SFT) in terms of Cellular automata (CA). In addition, we prove that 1. The following are equivalent for a non-singleton subshift of finite type XF. a) XF is transitive and Per(XF), the set of periodic points of XF, is cofinite b) XF is weak mixing c) XF is mixing. 2. For non-singleton sofic shifts, only the statements (a) and (b) are equivalent.\",\"PeriodicalId\":210685,\"journal\":{\"name\":\"3C Tecnología_Glosas de innovación aplicadas a la pyme\",\"volume\":\"103 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"3C Tecnología_Glosas de innovación aplicadas a la pyme\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17993/3ctecno.2022.v11n2e42.13-23\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"3C Tecnología_Glosas de innovación aplicadas a la pyme","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17993/3ctecno.2022.v11n2e42.13-23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we provide a characterization for the subshifts of finite type (SFT) in terms of Cellular automata (CA). In addition, we prove that 1. The following are equivalent for a non-singleton subshift of finite type XF. a) XF is transitive and Per(XF), the set of periodic points of XF, is cofinite b) XF is weak mixing c) XF is mixing. 2. For non-singleton sofic shifts, only the statements (a) and (b) are equivalent.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
