529 research outputs found
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 for the case of the full
shift (whose corresponding maximal subgroup is the maximal subgroup of the
minimal ideal). A corresponding result is proved for certain relatively free
profinite semigroups. We also establish some other analogies between the kernel
of the free profinite semigroup and the \J-class associated to an irreducible
sofic shift
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 semigroups, they are precisely
the pseudovarieties that are closed under Mal'cev product on the left by the
pseudovariety of locally trivial semigroups. A further characterization which
turns out to be instrumental is as the non-completely simple pseudovarieties
that are closed under two-sided Karnofsky-Rhodes expansion
Some operators that preserve the locality of a pseudovariety of semigroups
It is shown that if V is a local monoidal pseudovariety of semigroups, then
K(m)V, D(m)V and LI(m)V are local. Other operators of the form Z(m)(_) are
considered. In the process, results about the interplay between operators
Z(m)(_) and (_)*D_k are obtained.Comment: To appear in International Journal of Algebra and Computatio
Recognizing pro-R closures of regular languages
Given a regular language L, we effectively construct a unary semigroup that
recognizes the topological closure of L in the free unary semigroup relative to
the variety of unary semigroups generated by the pseudovariety R of all finite
R-trivial semigroups. In particular, we obtain a new effective solution of the
separation problem of regular languages by R-languages
On the insertion of n-powers
In algebraic terms, the insertion of -powers in words may be modelled at
the language level by considering the pseudovariety of ordered monoids defined
by the inequality . We compare this pseudovariety with several other
natural pseudovarieties of ordered monoids and of monoids associated with the
Burnside pseudovariety of groups defined by the identity . In
particular, we are interested in determining the pseudovariety of monoids that
it generates, which can be viewed as the problem of determining the Boolean
closure of the class of regular languages closed under -power insertions. We
exhibit a simple upper bound and show that it satisfies all pseudoidentities
which are provable from in which both sides are regular elements
with respect to the upper bound
- …