Complete classes of automata for the \(\alpha _ 0\)-product (Q1089802)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complete classes of automata for the \(\alpha _ 0\)-product |
scientific article; zbMATH DE number 4005625
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complete classes of automata for the \(\alpha _ 0\)-product |
scientific article; zbMATH DE number 4005625 |
Statements
Complete classes of automata for the \(\alpha _ 0\)-product (English)
0 references
1986
0 references
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.
0 references
product
0 references
Krohn-Rhodes Decomposition
0 references
loop-free product
0 references
series-parallel composition
0 references
cascade composition
0 references
R-product
0 references
quasisuperposition
0 references
