Abstract (EN):
A new topological representation for free profinite R-trivial semigroups in terms of spaces of vertex-labeled complete binary trees is obtained. Such a tree may be naturally folded into a finite automaton if and only if the element it represents is an omega-term. The variety of omega-semigroups generated by all finite R-trivial semigroups, with the usual interpretation of the omega-power, is then studied. A simple infinite basis of identities is exhibited and a linear-time solution of the word problem for relatively free w-semigroups is presented. This work is also compared with recent work of Bloom and Choffrut on transfinite words.
Idioma:
Inglês
Tipo (Avaliação Docente):
Científica