Complete classes of automata for the α 0 -product
Pál Dömösi,Zoltán Ésik +1 more
TLDR
A necessary and sufficient condition is given for a class of automata to be (homomorphically) complete for the α0-product, based on the Krohn-Rhodes Decomposition Theorem.About:
This article is published in Theoretical Computer Science.The article was published on 1986-11-01 and is currently open access. It has received 12 citations till now. The article focuses on the topics: Quantum finite automata & ω-automaton.read more
Citations
More filters
Journal ArticleDOI
Asynchronous automata networks can emulate any synchronous automata network
TL;DR: It is shown that any locally finite automata network with global synchronous updates can be emulated by another one, whose structure derives from that of by a simple construction, but whose updates are made asynchronously at its various component automata.
Journal ArticleDOI
Results on homomorphic realization of automata by a 0 -products
TL;DR: This paper uses the new aspect of irreducible semigroups to provide cascade decompositions of automata in a situation when a strict letter-to-letter replacement is essential.
Journal ArticleDOI
On α 0 -products and α 2 -products
TL;DR: In this paper, a necessary and sufficient condition has been formulated with regard to the completeness of the α0-product (cascade composition) for the Gluskov-type product for α2-product.
Journal ArticleDOI
On a representation of tree automata
Zoltán Ésik,Ferenc Gécseg +1 more
TL;DR: Decidability results are established for the unary case of sequential compositions of tree automata, called selective products, related to classical automata theory.
Journal ArticleDOI
Critical classes for the α 0 -product
Pál Dömösi,Zoltán Ésik +1 more
TL;DR: It is proved that the class K0 consisting of all counters and the two-state reset automation is critical and the Krohn-Rhodes Decomposition Theorem is generalized to all critical classes.
References
More filters
Journal ArticleDOI
Loop-free structure of sequential machines
TL;DR: It is shown how the amount of information flowing between the component machines in a realization can be studied by means of partition pairs.
Journal ArticleDOI
Cascade synthesis of finite-state machines
TL;DR: One can construct any finite-state machine as a cascade interconnection of machines whose inputs either permute the states or reset them all to one state using the Krohn-Rhodes theory.
Book ChapterDOI
Composition of Automata
TL;DR: It is a common problem of all branches of mathematics to represent an object by using other-possibly simpler — ones by investigating how various elements of certain type are composed.