{"title":"华威自动分组软件","authors":"D. Holt","doi":"10.1090/dimacs/025/05","DOIUrl":null,"url":null,"abstract":"This paper provides a description of the algorithms employed by the Warwick AUTOMATA package for calculating the finite state automata associated with a short-lex automatic group. The aim is to provide an overview of the whole process, rather than concentrating on technical details, which have been already been published elsewhere. A number of related programs are also described.","PeriodicalId":301293,"journal":{"name":"Geometric and Computational Perspectives on Infinite Groups","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"The Warwick automatic groups software\",\"authors\":\"D. Holt\",\"doi\":\"10.1090/dimacs/025/05\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper provides a description of the algorithms employed by the Warwick AUTOMATA package for calculating the finite state automata associated with a short-lex automatic group. The aim is to provide an overview of the whole process, rather than concentrating on technical details, which have been already been published elsewhere. A number of related programs are also described.\",\"PeriodicalId\":301293,\"journal\":{\"name\":\"Geometric and Computational Perspectives on Infinite Groups\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-07-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Geometric and Computational Perspectives on Infinite Groups\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/dimacs/025/05\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Geometric and Computational Perspectives on Infinite Groups","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/dimacs/025/05","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper provides a description of the algorithms employed by the Warwick AUTOMATA package for calculating the finite state automata associated with a short-lex automatic group. The aim is to provide an overview of the whole process, rather than concentrating on technical details, which have been already been published elsewhere. A number of related programs are also described.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
