McCammond's normal forms for free aperiodic semigroups revisited

• Type: Article in International Scientific Journal
• Date: 2015

Authors

Almeida, J (Author) FCUP; Zeitoun, M. (Author) Other; Costa, J. C. (Author) Other

Journal

Title: LMS Journal of Computation and Mathematics

Vol. 18

Pages: 130-147

ISSN: 1461-1570

Publisher: Cambridge University Press

Indexing

ISI Web of Knowledge - 5 Citations

Scopus - 5 Citations

Other information

Authenticus ID: P-00G-6CA

DOI: 10.1112/s1461157014000448

Abstract (EN): This paper revisits the solution of the word problem for w-terms interpreted over finite aperiodic semigroups, obtained by J. McCammond. The original proof of correctness of McCammond's algorithm, based on normal forms for such terms, uses McCammond's solution of the word problem for certain Burnside semigroups. In this paper, we establish a new, simpler, correctness proof of McCammond's algorithm, based on properties of certain regular languages associated with the normal forms. This method leads to new applications.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 18