{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T15:15:07Z","timestamp":1770909307139,"version":"3.50.1"},"reference-count":27,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["LMS J. Comput. Math."],"published-print":{"date-parts":[[2015]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper revisits the solution of the word problem for<jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S1461157014000448_inline1\"\/><jats:tex-math>${\\it\\omega}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-terms interpreted over finite aperiodic semigroups, obtained by J.\u00a0McCammond. The original proof of correctness of McCammond\u2019s algorithm, based on normal forms for such terms, uses McCammond\u2019s solution of the word problem for certain Burnside semigroups. In this paper, we establish a new, simpler, correctness proof of McCammond\u2019s algorithm, based on properties of certain regular languages associated with the normal forms. This method leads to new applications.<\/jats:p>","DOI":"10.1112\/s1461157014000448","type":"journal-article","created":{"date-parts":[[2015,1,27]],"date-time":"2015-01-27T09:15:36Z","timestamp":1422350136000},"page":"130-147","source":"Crossref","is-referenced-by-count":4,"title":["McCammond\u2019s normal forms for free aperiodic semigroups revisited"],"prefix":"10.1112","volume":"18","author":[{"given":"J.","family":"Almeida","sequence":"first","affiliation":[]},{"given":"J. C.","family":"Costa","sequence":"additional","affiliation":[]},{"given":"M.","family":"Zeitoun","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2015,1,1]]},"reference":[{"key":"S1461157014000448_r20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019"},{"key":"S1461157014000448_r10","doi-asserted-by":"publisher","DOI":"10.1112\/S0024611500012144"},{"key":"S1461157014000448_r14","first-page":"159","article-title":"Canonical forms for free \ud835\udf05-semigroups","volume":"16","author":"Costa","year":"2014","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"S1461157014000448_r4","first-page":"531","article-title":"Some algorithmic problems for pseudovarieties","volume":"54(suppl.)","author":"Almeida","year":"1999","journal-title":"Publ. Math. Debrecen"},{"key":"S1461157014000448_r8","doi-asserted-by":"publisher","DOI":"10.1007\/s00233-014-9574-3"},{"key":"S1461157014000448_r21","doi-asserted-by":"publisher","DOI":"10.1142\/S021819679100002X"},{"key":"S1461157014000448_r23","volume-title":"Counter-free automata","author":"McNaughton","year":"1971"},{"key":"S1461157014000448_r17","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(88)90042-4"},{"key":"S1461157014000448_r19","volume-title":"Combinatorics on words","author":"Lothaire","year":"1983"},{"key":"S1461157014000448_r7","doi-asserted-by":"crossref","first-page":"445","DOI":"10.4171\/pm\/1792","article-title":"Complete reducibility of systems of equations with respect to R","volume":"64","author":"Almeida","year":"2007","journal-title":"Port. Math."},{"key":"S1461157014000448_r26","doi-asserted-by":"publisher","DOI":"10.1007\/b104443"},{"key":"S1461157014000448_r3","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196799000163"},{"key":"S1461157014000448_r25","volume-title":"CSL-LICS \u201914: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","author":"Place","year":"2014"},{"key":"S1461157014000448_r27","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90108-7"},{"key":"S1461157014000448_r11","first-page":"1","volume-title":"Algorithmic problems in groups and semigroups","author":"Almeida","year":"2000"},{"key":"S1461157014000448_r18","first-page":"374","volume-title":"31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)","volume":"25","author":"Huschenbett","year":"2014"},{"key":"S1461157014000448_r1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(91)90019-X"},{"key":"S1461157014000448_r9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2013.07.011"},{"key":"S1461157014000448_r5","volume-title":"Structural theory of automata, semigroups, and universal algebra: Proceedings of the NATO Advanced Study Institute on Structural Theory of Automata, Semigroups and Universal Algebra, Montr\u00e9al, Qu\u00e9bec, Canada, 7\u201318 July 2003","volume":"207","author":"Almeida","year":"2005"},{"key":"S1461157014000448_r6","doi-asserted-by":"publisher","DOI":"10.1007\/s00605-005-0324-1"},{"key":"S1461157014000448_r16","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196704001955"},{"key":"S1461157014000448_r2","doi-asserted-by":"publisher","DOI":"10.1142\/2481"},{"key":"S1461157014000448_r13","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(00)00176-6"},{"key":"S1461157014000448_r22","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196701000693"},{"key":"S1461157014000448_r24","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.08.003"},{"key":"S1461157014000448_r12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.10.019"},{"key":"S1461157014000448_r15","doi-asserted-by":"publisher","DOI":"10.1142\/S021819670900507X"}],"container-title":["LMS Journal of Computation and Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1461157014000448","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T21:04:30Z","timestamp":1717707870000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1461157014000448\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015]]}},"alternative-id":["S1461157014000448"],"URL":"https:\/\/doi.org\/10.1112\/s1461157014000448","relation":{},"ISSN":["1461-1570"],"issn-type":[{"value":"1461-1570","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}