McCammond's normal forms for free aperiodic semigroups revisited

Detalhes bibliográficos
Autor(a) principal: Almeida, J
Data de Publicação: 2015
Outros Autores: Zeitoun, M., Costa, J. C.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: https://hdl.handle.net/10216/107465
Resumo: 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.
id RCAP_66de0c41496bfb7dc95b2304f6568ea9
oai_identifier_str oai:repositorio-aberto.up.pt:10216/107465
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling McCammond's normal forms for free aperiodic semigroups revisitedThis 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.20152015-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/10216/107465eng1461-157010.1112/s1461157014000448Almeida, JZeitoun, M.Costa, J. C.info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-11-29T14:57:58Zoai:repositorio-aberto.up.pt:10216/107465Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T00:12:38.848584Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv McCammond's normal forms for free aperiodic semigroups revisited
title McCammond's normal forms for free aperiodic semigroups revisited
spellingShingle McCammond's normal forms for free aperiodic semigroups revisited
Almeida, J
title_short McCammond's normal forms for free aperiodic semigroups revisited
title_full McCammond's normal forms for free aperiodic semigroups revisited
title_fullStr McCammond's normal forms for free aperiodic semigroups revisited
title_full_unstemmed McCammond's normal forms for free aperiodic semigroups revisited
title_sort McCammond's normal forms for free aperiodic semigroups revisited
author Almeida, J
author_facet Almeida, J
Zeitoun, M.
Costa, J. C.
author_role author
author2 Zeitoun, M.
Costa, J. C.
author2_role author
author
dc.contributor.author.fl_str_mv Almeida, J
Zeitoun, M.
Costa, J. C.
description 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.
publishDate 2015
dc.date.none.fl_str_mv 2015
2015-01-01T00:00:00Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://hdl.handle.net/10216/107465
url https://hdl.handle.net/10216/107465
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 1461-1570
10.1112/s1461157014000448
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799136048812392449

Registros relacionados