For a pseudovariety of ordered semigroups, let be the class of sofic subshifts whose syntactic semigroup lies in . It is proved that if contains then is closed under taking shift equivalent subshifts, and conversely, if is closed under taking conjugate subshifts then contains and . Almost finite type subshifts are characterized as the irreducible elements of , which gives a new proof that the class of almost finite type subshifts is closed under taking shift equivalent subshifts.http://www.sciencedirect.com/science/article/B6V0K-4KNKH45-2/1/eb50d11357c8404e35ea3525dab4e06
Abstract. The Pin-Reutenauer algorithm gives a method, that can be viewed as a descriptive procedure...
If V is a given variety and F: A-\u3e F(A) a function which assigns formula , then the F-closed sub...
We show that, for every pseudovariety of groups H, the pseudovariety (H) over bar, consisting of all...
For a pseudovariety of ordered semigroups, let be the class of sofic subshifts whose syntactic semig...
Abstract: It is studied how taking the inverse image by a sliding block code affects the syntactic s...
AbstractWe define new subclasses of the class of irreducible sofic shifts. These classes form an inf...
We define new subclasses of the class of sofic shifts. These classes form an infinite hierarchy. For...
It is given a structural conjugacy invariant in the set of pseudowords whose nite factors are fact...
International audienceWe define new subclasses of the class of irreducible sofic shifts. These class...
This note uses some recent powerful tools related with semidirect products V W of pseudovarieties o...
The class CS, of all semigroups that are embeddable in completely simple semigroups forms a quasivar...
This article defines the notion of hyperdecidability for a class of finite semigroups, which is clos...
We show that if H is a pseudovariety of groups closed under semidirect product with the pseudovarie...
: We use classical results on the lattice L(B) of varieties of band (idempotent) semigroups to obtai...
Two semigroups are lattice isomorphic if the lattices of their subsemigroups are isomorphic, and a c...
Abstract. The Pin-Reutenauer algorithm gives a method, that can be viewed as a descriptive procedure...
If V is a given variety and F: A-\u3e F(A) a function which assigns formula , then the F-closed sub...
We show that, for every pseudovariety of groups H, the pseudovariety (H) over bar, consisting of all...
For a pseudovariety of ordered semigroups, let be the class of sofic subshifts whose syntactic semig...
Abstract: It is studied how taking the inverse image by a sliding block code affects the syntactic s...
AbstractWe define new subclasses of the class of irreducible sofic shifts. These classes form an inf...
We define new subclasses of the class of sofic shifts. These classes form an infinite hierarchy. For...
It is given a structural conjugacy invariant in the set of pseudowords whose nite factors are fact...
International audienceWe define new subclasses of the class of irreducible sofic shifts. These class...
This note uses some recent powerful tools related with semidirect products V W of pseudovarieties o...
The class CS, of all semigroups that are embeddable in completely simple semigroups forms a quasivar...
This article defines the notion of hyperdecidability for a class of finite semigroups, which is clos...
We show that if H is a pseudovariety of groups closed under semidirect product with the pseudovarie...
: We use classical results on the lattice L(B) of varieties of band (idempotent) semigroups to obtai...
Two semigroups are lattice isomorphic if the lattices of their subsemigroups are isomorphic, and a c...
Abstract. The Pin-Reutenauer algorithm gives a method, that can be viewed as a descriptive procedure...
If V is a given variety and F: A-\u3e F(A) a function which assigns formula , then the F-closed sub...
We show that, for every pseudovariety of groups H, the pseudovariety (H) over bar, consisting of all...