Title
Subword Complexity Of Profinite Words And Subgroups Of Free Profinite Semigroups
Abstract
We study free profinite subgroups of free profinite semigroups of the same rank using, as main tools, iterated continuous endomorphisms, subword complexity, and the associated entropy. Main results include a general scheme to produce such subgroups and a proof that the complement of the minimal ideal in a free profinite semigroup on more than one generator is closed under all implicit operations that do not lie in the minimal ideal and even under their infinite iteration.
Year
DOI
Venue
2006
10.1142/S0218196706002883
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION
Keywords
Field
DocType
free profinite semigroup, profinite word, implicit operator, free profinite group, group-generic endornorphism, iteration, subword complexity, entropy
Discrete mathematics,Algebra,Minimal ideal,Profinite group,Semigroup,Iterated function,Mathematics,Endomorphism
Journal
Volume
Issue
ISSN
16
2
0218-1967
Citations 
PageRank 
References 
6
0.71
5
Authors
2
Name
Order
Citations
PageRank
J. Almeida16115.24
Mikhail V. Volkov212118.25