McCammond's normal forms for free aperiodic semigroups revisited
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 certa...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2015
|
| Texto completo: | https://hdl.handle.net/10216/107465 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/107465 |