{"title":"有界有理锥的代换","authors":"J. Beauquier, M. Latteux","doi":"10.1109/SFCS.1982.90","DOIUrl":null,"url":null,"abstract":"We study the family S of rational cones obtained by iterated substitutions from rational cones L1, .., Ln. This family is a semi-group and to every non empty word u defined on the alphabet {L1, ..., Ln}, corresponds a rational cone U of S. We give sufficient conditions for S to be free (U = U′ implies u = u′) and to verify the subpattern property (U ⊂ U′ implies u is a subpattern of u′). We study, more particularly, the case where L1, ..., Ln are bounded rational cones.","PeriodicalId":127919,"journal":{"name":"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1982-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Substitution of bounded rational cone\",\"authors\":\"J. Beauquier, M. Latteux\",\"doi\":\"10.1109/SFCS.1982.90\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the family S of rational cones obtained by iterated substitutions from rational cones L1, .., Ln. This family is a semi-group and to every non empty word u defined on the alphabet {L1, ..., Ln}, corresponds a rational cone U of S. We give sufficient conditions for S to be free (U = U′ implies u = u′) and to verify the subpattern property (U ⊂ U′ implies u is a subpattern of u′). We study, more particularly, the case where L1, ..., Ln are bounded rational cones.\",\"PeriodicalId\":127919,\"journal\":{\"name\":\"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1982.90\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1982.90","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
我们研究了由有理锥L1，…通过迭代替换得到的有理锥族S。Ln。这个族是一个半群，对于字母{L1，…， Ln}，对应于S的有理锥U，我们给出S是自由的充分条件(U = U '暗示U = U ')，并验证子模式的性质(U≠U '暗示U是U '的子模式)。更具体地说，我们研究L1，…， Ln是有界有理锥。
We study the family S of rational cones obtained by iterated substitutions from rational cones L1, .., Ln. This family is a semi-group and to every non empty word u defined on the alphabet {L1, ..., Ln}, corresponds a rational cone U of S. We give sufficient conditions for S to be free (U = U′ implies u = u′) and to verify the subpattern property (U ⊂ U′ implies u is a subpattern of u′). We study, more particularly, the case where L1, ..., Ln are bounded rational cones.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
