AbstractThe class of all state-independent automata is characterized as a subclass of all semigroup automata (automata generated by semigroups). A state-independent automaton is identified as an automaton over a finite semigroup that is stationary on the right. Associated results are included
23 pages, 3 figuresWe prove that the semigroup generated by a reversible Mealy automaton contains a ...
The purpose of this paper is to describe structural properties of automata whose transition semigrou...
For a given reachable automaton A, we prove that the (state-) endomorphism monoid End(A) divides its...
AbstractThe class of all state-independent automata is characterized as a subclass of all semigroup ...
The classes of automata characterized by certain semigroups are investigated: It isshown that the cl...
AbstractNecessary and sufficient conditions for a given automaton to be of left identity type, of id...
In this paper we combine the algebraic properties of Mealy machines generating selfsimilar groups an...
In this dissertation we classify the metabelian groups arising from a restricted class of invertible...
Every cyclic automaton is isomorphic to a semi-group quotient automaton, while for a homogeneous aut...
AbstractThe concept of an automaton group generalizes easily to semigroups, and the systematic study...
Left-discrimination of a semigroup is defined and shown to be a sufficient condition that a semigrou...
AbstractWe study a special class of finite automata called reversible and defined by the following p...
The aim of this paper is to investigate whether the class of automaton semigroups is closed under ce...
This paper gives necessary and sufficient conditions on a semigroup to guarantee that if the semigro...
AbstractLet V be a pseudovariety of finite semigroups; an automation A = (X, Σ, M) is called V-type ...
23 pages, 3 figuresWe prove that the semigroup generated by a reversible Mealy automaton contains a ...
The purpose of this paper is to describe structural properties of automata whose transition semigrou...
For a given reachable automaton A, we prove that the (state-) endomorphism monoid End(A) divides its...
AbstractThe class of all state-independent automata is characterized as a subclass of all semigroup ...
The classes of automata characterized by certain semigroups are investigated: It isshown that the cl...
AbstractNecessary and sufficient conditions for a given automaton to be of left identity type, of id...
In this paper we combine the algebraic properties of Mealy machines generating selfsimilar groups an...
In this dissertation we classify the metabelian groups arising from a restricted class of invertible...
Every cyclic automaton is isomorphic to a semi-group quotient automaton, while for a homogeneous aut...
AbstractThe concept of an automaton group generalizes easily to semigroups, and the systematic study...
Left-discrimination of a semigroup is defined and shown to be a sufficient condition that a semigrou...
AbstractWe study a special class of finite automata called reversible and defined by the following p...
The aim of this paper is to investigate whether the class of automaton semigroups is closed under ce...
This paper gives necessary and sufficient conditions on a semigroup to guarantee that if the semigro...
AbstractLet V be a pseudovariety of finite semigroups; an automation A = (X, Σ, M) is called V-type ...
23 pages, 3 figuresWe prove that the semigroup generated by a reversible Mealy automaton contains a ...
The purpose of this paper is to describe structural properties of automata whose transition semigrou...
For a given reachable automaton A, we prove that the (state-) endomorphism monoid End(A) divides its...
DOI
Add to ORKG