Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1112/S1461157014000448 | LMS JOURNAL OF COMPUTATION AND MATHEMATICS |
Field | DocType | Volume |
Discrete mathematics,Correctness proofs,Star-free language,Algebra,Word problem (mathematics education),Correctness,Aperiodic semigroup,Regular language,Aperiodic graph,Mathematics | Journal | 18 |
Issue | ISSN | Citations |
1.0 | 1461-1570 | 1 |
PageRank | References | Authors |
0.38 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Almeida | 1 | 61 | 15.24 |
| José Carlos Costa | 2 | 17 | 4.57 |
| Marc Zeitoun | 3 | 288 | 24.51 |