A geometric interpretation of the Schützenberger group of a minimal subshift

  title={A geometric interpretation of the Sch{\"u}tzenberger group of a minimal subshift},
  author={Jorge Almeida and A. Costa},
  journal={Arkiv f{\"o}r Matematik},
The first author has associated in a natural way a profinite group to each irreducible subshift. The group in question was initially obtained as a maximal subgroup of a free profinite semigroup. In the case of minimal subshifts, the same group is shown in the present paper to also arise from geometric considerations involving the Rauzy graphs of the subshift. Indeed, the group is shown to be isomorphic to the inverse limit of the profinite completions of the fundamental groups of the Rauzy… 

The Karoubi envelope of the mirage of a subshift

Abstract We study a correspondence associating to each subshift of a subcategory of the Karoubi envelope of the free profinite semigroup generated by A. The objects of this category are the

On the group of a rational maximal bifix code

Abstract We give necessary and sufficient conditions for the group of a rational maximal bifix code Z to be isomorphic with the F-group of Z∩F{Z\cap F}, when F is recurrent and Z∩F{Z\cap F} is

Profinite topologies

Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also

Freeness of Sch\"utzenberger groups of primitive substitutions

Our main goal is to study the freeness of Schützenberger groups defined by primitive substitutions. Our findings include a simple freeness test for these groups, which is applied to exhibit a

Groups, Languages and Dendric Shifts

A survey of results obtained on symbolic dynamical systems called dendric shifts, which includes the Return Theorem and the Finite Index Basis Theorem which both put in evidence the central role played by free groups in these systems.

Symbolic dynamics and semigroup theory

A major motivation for the development of semigroup theory was, and still is, its applications to the study of formal languages. Therefore, it is not surprising that the correspondence $\mathcal

Suffix-connected languages

A profinite approach to complete bifix decodings of recurrent languages

  • A. Costa
  • Computer Science, Mathematics
  • 2022
It is shown that the Sch¨utzenberger group of an irreducible symbolic dynamical system is an invariant of eventual conjugacy and an analogous result is obtained for recurrent languages.

Bifix codes, Combinatorics on Words and Symbolic Dynamical Systems. (Codes bifixes, combinatoire des mots et systèmes dynamiques symboliques)

This thesis presents several classes of sets of words defined by the possible shapes that the graphs of elements in the set can have, and proves several results concerning closure properties, cardinality of the bifix codes and set of return words in these sets, connection between return words and basis of the free groups, as well as between b crucifix codes and subgroup of thefree group.

Profinite semigroups

A survey of results on profinite semigroups and their link with symbolic dynamics and some original results on the Schützenberger groups associated to a uniformly recurrent set are included.



Presentations of Schützenberger groups of minimal subshifts

In previous work, the first author established a natural bijection between minimal subshifts and maximal regular J -classes of free profinite semigroups. In this paper, the Schützenberger groups of

Profinite groups associated to sofic shifts are free

We show that the maximal subgroup of the free profinite semigroup associated by Almeida to an irreducible sofic shift is a free profinite group, generalizing an earlier result of the second author

Conjugacy Invariants of Subshifts: an Approach from Profinite Semigroup Theory

  • A. Costa
  • Mathematics
    Int. J. Algebra Comput.
  • 2006
A shift equivalence invariant is obtained, improving an invariant introduced by Beal, Fiorenzi and Perrin using different techniques, and used to prove that some almost finite type subshifts with the same zeta function are not shift equivalent.

The algebraic theory of semigroups

This book, along with volume I, which appeared previously, presents a survey of the structure and representation theory of semi groups. Volume II goes more deeply than was possible in volume I into

Closed subgroups of free profinite monoids are projective profinite groups

We prove that the class of closed subgroups of free profinite monoids is precisely the class of projective profinite groups. In particular, the profinite groups associated to minimal symbolic

Maximal subgroups of the minimal ideal of a free profinite monoid are free

AbstractWe answer a question of Margolis from 1997 by establishing that the maximal subgroup of the minimal ideal of a finitely generated free profinite monoid is a free profinite group. More

Subword Complexity of Profinite Words and Subgroups of Free Profinite Semigroups

A general scheme to produce free profinite subgroups of freeProfinite semigroups of the same rank using iterated continuous endomorphisms, subword complexity, and the associated entropy and a proof that the complement of the minimal ideal in a free Profinite semigroup on more than one generator is closed.


Let V be a pseudovariety of finite groups such that free groups are residually V, and let ϕ: F(A) → F(B) be an injective morphism between finitely generated free groups. We characterize the

On the Transition Semigroups of Centrally Labeled Rauzy Graphs

It is shown that its transition semigroup is the syntactic semigroup of the language recognized by the automaton, and an inverse limit of the partial semigroups of nonzero regular elements of their transition semig groups is described.