Subword complexity of profinite words and subgroups of free profinite semigroups

• Type: Article in International Scientific Journal
• Date: 2006

Authors

Almeida, J (Author) FCUP; Volkov, MV (Author) Other

Journal

Title: International Journal of Algebra and Computation

Vol. 16

Pages: 221-258

ISSN: 0218-1967

Publisher: World Scientific

Indexing

ISI Web of Knowledge - 23 Citations

Scopus - 26 Citations

Scientific classification

FOS: Natural sciences > Mathematics

Other information

Authenticus ID: P-004-MF2

DOI: 10.1142/S0218196706002883

Abstract (EN): 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.

Language: English

Type (Professor's evaluation): Scientific