A series decomposition of permutation-reset automata is set up. The structure of the characteristic semigroups of its components is determined as factor groups and constituents of the group of the original automaton. It is shown that a realization of this decomposition contains fewer components than in the usual Krohn-Rhodes decomposition of permutation-reset automata
In this paper we combine the algebraic properties of Mealy machines generating selfsimilar groups an...
AbstractPin showed that every p-state automaton (p a prime) containing a cyclic permutation and a no...
This paper presents an application of the theory of automaton automorphisms to the decomposition the...
A series decomposition of permutation-reset automata is set up. The structure of the characteristic ...
A series-parallel decomposition of an automaton A into r components (r ⩾ 1) is said to be practical ...
The structure of a strongly connected permutation automaton, a quasiperfect automaton, and a perfect...
The classes of automata characterized by certain semigroups are investigated: It isshown that the cl...
AbstractLet A = (S, Σ, N) be a strongly connected automaton and e be a minimal idempotent of charact...
AbstractThe notion of an irreducible semigroup has been fundamental to the Krohn-Rhodes decompositio...
In this paper we characterize all permutation automata which can be linearly realized over the field...
Automata act as classical models for recognition devices. From the previous researches, the classica...
In this dissertation we classify the metabelian groups arising from a restricted class of invertible...
We analyse two very simple Petri nets inspired by the Oregonator model of the Belousov-Zhabotinsky r...
The purpose of this investigation is to determine how the structure of a strongly connected strictly...
AbstractThe concept of an automaton group generalizes easily to semigroups, and the systematic study...
In this paper we combine the algebraic properties of Mealy machines generating selfsimilar groups an...
AbstractPin showed that every p-state automaton (p a prime) containing a cyclic permutation and a no...
This paper presents an application of the theory of automaton automorphisms to the decomposition the...
A series decomposition of permutation-reset automata is set up. The structure of the characteristic ...
A series-parallel decomposition of an automaton A into r components (r ⩾ 1) is said to be practical ...
The structure of a strongly connected permutation automaton, a quasiperfect automaton, and a perfect...
The classes of automata characterized by certain semigroups are investigated: It isshown that the cl...
AbstractLet A = (S, Σ, N) be a strongly connected automaton and e be a minimal idempotent of charact...
AbstractThe notion of an irreducible semigroup has been fundamental to the Krohn-Rhodes decompositio...
In this paper we characterize all permutation automata which can be linearly realized over the field...
Automata act as classical models for recognition devices. From the previous researches, the classica...
In this dissertation we classify the metabelian groups arising from a restricted class of invertible...
We analyse two very simple Petri nets inspired by the Oregonator model of the Belousov-Zhabotinsky r...
The purpose of this investigation is to determine how the structure of a strongly connected strictly...
AbstractThe concept of an automaton group generalizes easily to semigroups, and the systematic study...
In this paper we combine the algebraic properties of Mealy machines generating selfsimilar groups an...
AbstractPin showed that every p-state automaton (p a prime) containing a cyclic permutation and a no...
This paper presents an application of the theory of automaton automorphisms to the decomposition the...
DOI
Add to ORKG