This paper gives necessary and sufficient conditions on a semigroup to guarantee that if the semigroup is isomorphic to the semigroup of a finite automaton, then the finite automaton can be linearly realized over GF(p), for some prime p
AbstractLet V be a pseudovariety of finite semigroups; an automation A = (X, Σ, M) is called V-type ...
In this paper we construct for a given algebra automaton the semigroup of functionswhich can be defi...
In 1964 Weeg [6] has posed a question asking which semi-groups admit strongly connected automata. T...
This paper gives necessary and sufficient conditions on a semigroup to guarantee that if the semigro...
In this paper we characterize all permutation automata which can be linearly realized over the field...
The relation between ordinary automata, their fixed analogs of extensions, fixed analogs of general...
The aim of this paper is to investigate whether the class of automaton semigroups is closed under ce...
AbstractNecessary and sufficient conditions for a given automaton to be of left identity type, of id...
FCT exploratory project IF/01622/2013/CP1161/CT0001. FCT fellowship (IF/01622/2013/CP1161/CT0001).Th...
In this dissertation we classify the metabelian groups arising from a restricted class of invertible...
AbstractThe concept of an automaton group generalizes easily to semigroups, and the systematic study...
The classes of automata characterized by certain semigroups are investigated: It isshown that the cl...
We develop an effective and natural approach to interpret any semigroup admitting a special language...
Left-discrimination of a semigroup is defined and shown to be a sufficient condition that a semigrou...
International audienceThis paper addresses a decision problem highlighted by Grigorchuk, Nekrashevic...
AbstractLet V be a pseudovariety of finite semigroups; an automation A = (X, Σ, M) is called V-type ...
In this paper we construct for a given algebra automaton the semigroup of functionswhich can be defi...
In 1964 Weeg [6] has posed a question asking which semi-groups admit strongly connected automata. T...
This paper gives necessary and sufficient conditions on a semigroup to guarantee that if the semigro...
In this paper we characterize all permutation automata which can be linearly realized over the field...
The relation between ordinary automata, their fixed analogs of extensions, fixed analogs of general...
The aim of this paper is to investigate whether the class of automaton semigroups is closed under ce...
AbstractNecessary and sufficient conditions for a given automaton to be of left identity type, of id...
FCT exploratory project IF/01622/2013/CP1161/CT0001. FCT fellowship (IF/01622/2013/CP1161/CT0001).Th...
In this dissertation we classify the metabelian groups arising from a restricted class of invertible...
AbstractThe concept of an automaton group generalizes easily to semigroups, and the systematic study...
The classes of automata characterized by certain semigroups are investigated: It isshown that the cl...
We develop an effective and natural approach to interpret any semigroup admitting a special language...
Left-discrimination of a semigroup is defined and shown to be a sufficient condition that a semigrou...
International audienceThis paper addresses a decision problem highlighted by Grigorchuk, Nekrashevic...
AbstractLet V be a pseudovariety of finite semigroups; an automation A = (X, Σ, M) is called V-type ...
In this paper we construct for a given algebra automaton the semigroup of functionswhich can be defi...
In 1964 Weeg [6] has posed a question asking which semi-groups admit strongly connected automata. T...
DOI
Add to ORKG