McCammond's normal forms for free aperiodic semigroups revisited

This paper revisits the solution of the word problem for omega-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 c...

Full description

Bibliographic Details
Main Author: Almeida, Jorge (author)
Other Authors: Costa, José Carlos (author), Zeitoun, Marc (author)
Format: article
Language:eng
Published: 2015
Subjects:
Pseudovariety
Word problem
Aperiodic semigroup
Star-free language
McCammond normal form
Regular language
Ciências Naturais::Matemáticas
Ciências Naturais::Ciências da Computação e da Informação
Science & Technology
Online Access:http://hdl.handle.net/1822/36665
Country:Portugal
Oai:oai:repositorium.sdum.uminho.pt:1822/36665

Internet

http://hdl.handle.net/1822/36665

Similar Items