Infinite-vertex free profinite semigroupoids and symbolic dynamics

  title={Infinite-vertex free profinite semigroupoids and symbolic dynamics},
  author={Jorge Almeida and Alfredo Costa},
  journal={Journal of Pure and Applied Algebra},

Figures from this paper

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
Representations of relatively free profinite semigroups, irreducibility, and order primitivity
We establish that, under certain closure assumptions on a pseudovariety of semigroups, the corresponding relatively free profinite semigroups freely generated by a non-singleton finite set act
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
Factoriality and the Pin-Reutenauer procedure
It is proved that the natural analogue of the Pin-Reutenauer descriptive procedure for the closure of a rational language in the free group with respect to the profin ite topology holds for the pseudovariety of all finite semigroups.
A paper of Almeida and Trotter [‘The pseudoidentity problem and reducibility for completely regular semigroups’, Bull. Aust. Math. Soc.63 (2001), 407–433] makes essential use of free profinite
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.
Equidivisible pseudovarieties of semigroups
We give a complete characterization of pseudovarieties of semigroups whose finitely generated relatively free profinite semigroups are equidivisible. Besides the pseudovarieties of completely simple
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
A geometric interpretation of the Schützenberger group of a minimal subshift
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


This is a survey and announcement of recent results on the structure of free profinite semigroups using techniques and results from symbolic dynamics. The intimate connection between uniformly
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.
Profinite semigroups and applications
Profinite semigroups may be described briefly as projective limits of finite semigroups. They come about naturally by studying pseudovarieties of finite semigroups which in turn serve as a
Finite Semigroups and Universal Algebra
Part 1 Finite universal algebra: elements of universal algebra order and topology finite algebras decidability. Part 2 Finite semigroups and monoids: permutativity operators relating semigroups and
Profinite Semigroups, Varieties, Expansions and the Structure of Relatively Free Profinite Semigroups
The structure of the minimal ideal of relatively free profinite semigroups is studied showing, in particular, that the minimal Ideal of the free Profinite semigroup on a finite set with more than two generators is not a relatively freeProfinite completely simple semigroup, as well as some generalizations to related pseudovarieties.
Profinite Methods in Semigroup Theory
  • P. Weil
  • Mathematics
    Int. J. Algebra Comput.
  • 2002
The contribution of profinite methods and the way they enriched and modified finite semigroup theory are surveyed.
Locally testable semigroups
The locally testable semigroups were discovered in the study of finite automata (see [8], [12] for history and motivation). In this paper, we study the locally testable semigroups from a purely
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 pseudoidentity problem and reducibility for completely regular semigroups
Dedicated to George Szekeres on the occasion of his 90th birthday Necessary and sufficient conditions for equality over the pseudovariety CR of all finite completely regular semigroups are obtained.
Algebraic theory of machines, languages and semigroups
Abstract : The book is an integrated exposition of the algebraic, and especially semigroup-theoretic, approach to machines and languages. It is designed to carry the reader from the elementary theory