T. D. H. Coleman, J. D. Mitchell, F. L. Smith, M. Tsalakou
{"title":"半群和单体的 Todd-Coxeter 算法","authors":"T. D. H. Coleman, J. D. Mitchell, F. L. Smith, M. Tsalakou","doi":"10.1007/s00233-024-10431-z","DOIUrl":null,"url":null,"abstract":"<p>In this paper we provide an account of the Todd–Coxeter algorithm for computing congruences on semigroups and monoids. We also give a novel description of an analogue for semigroups of the so-called Felsch strategy from the Todd–Coxeter algorithm for groups.\n</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Todd–Coxeter algorithm for semigroups and monoids\",\"authors\":\"T. D. H. Coleman, J. D. Mitchell, F. L. Smith, M. Tsalakou\",\"doi\":\"10.1007/s00233-024-10431-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper we provide an account of the Todd–Coxeter algorithm for computing congruences on semigroups and monoids. We also give a novel description of an analogue for semigroups of the so-called Felsch strategy from the Todd–Coxeter algorithm for groups.\\n</p>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-05-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s00233-024-10431-z\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00233-024-10431-z","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Todd–Coxeter algorithm for semigroups and monoids
In this paper we provide an account of the Todd–Coxeter algorithm for computing congruences on semigroups and monoids. We also give a novel description of an analogue for semigroups of the so-called Felsch strategy from the Todd–Coxeter algorithm for groups.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
