McCammond's normal forms for free aperiodic semigroups revisited
Formal Languages and Automata Theory
2019-02-20 v1
Abstract
This paper revisits the solution of the word problem for -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.
Keywords
Cite
@article{arxiv.1406.0888,
title = {McCammond's normal forms for free aperiodic semigroups revisited},
author = {Jorge Almeida and José Carlos Costa and Marc Zeitoun},
journal= {arXiv preprint arXiv:1406.0888},
year = {2019}
}