{"title":"虚自由群的有限生成子半群","authors":"Pedro V. Silva, A. Zakharov","doi":"10.1515/gcc-2018-0008","DOIUrl":null,"url":null,"abstract":"Abstract We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization of graded submonoids in virtually free groups as quasi-geodesic submonoids, and show that their word problem is rational (as a relation). We also solve the isomorphism problem for this class of monoids, generalizing earlier results for submonoids of free monoids. We also prove that the classes of graded monoids, regular monoids and Kleene monoids coincide for submonoids of free groups.","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"43 1","pages":"63 - 82"},"PeriodicalIF":0.1000,"publicationDate":"2018-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On finitely generated submonoids of virtually free groups\",\"authors\":\"Pedro V. Silva, A. Zakharov\",\"doi\":\"10.1515/gcc-2018-0008\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization of graded submonoids in virtually free groups as quasi-geodesic submonoids, and show that their word problem is rational (as a relation). We also solve the isomorphism problem for this class of monoids, generalizing earlier results for submonoids of free monoids. We also prove that the classes of graded monoids, regular monoids and Kleene monoids coincide for submonoids of free groups.\",\"PeriodicalId\":41862,\"journal\":{\"name\":\"Groups Complexity Cryptology\",\"volume\":\"43 1\",\"pages\":\"63 - 82\"},\"PeriodicalIF\":0.1000,\"publicationDate\":\"2018-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Groups Complexity Cryptology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/gcc-2018-0008\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Groups Complexity Cryptology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/gcc-2018-0008","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
On finitely generated submonoids of virtually free groups
Abstract We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization of graded submonoids in virtually free groups as quasi-geodesic submonoids, and show that their word problem is rational (as a relation). We also solve the isomorphism problem for this class of monoids, generalizing earlier results for submonoids of free monoids. We also prove that the classes of graded monoids, regular monoids and Kleene monoids coincide for submonoids of free groups.