A necessary and sufficient condition is given for a class of automata to be (homomorphically) complete for the alpha //0-product. The result is based on the Krohn-Rhodes Decomposition Theorem. The notion of the alpha //0-product essentially coincides with either of the following: loop-free product, series-parallel composition, cascade composition, R-product, quasisuperposition.
|Number of pages||14|
|Journal||Theoretical Computer Science|
|Publication status||Published - Dec 1 1986|
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)