Complete classes of automata for the \(\alpha _ 0\)-product

DOI10.1016/0304-3975(86)90129-5zbMath0619.68053OpenAlexW1538941884MaRDI QIDQ1089802

Pál Dömösi, Zoltán Ésik

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90129-5

zbMATH Keywords

productquasisuperpositioncascade compositionKrohn-Rhodes Decompositionloop-free productR-productseries-parallel composition

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items

On \(\alpha _ 0\)-products and \(\alpha _ 2\)-products ⋮ On a representation of tree automata ⋮ Critical classes for the \(\alpha _ 0\)-product ⋮ Results on homomorphic realization of automata by \(\alpha_ 0\)-products ⋮ ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK ⋮ Varieties of automata and transformation semigroups

Cites Work

• Loop-free structure of sequential machines
• Cascade synthesis of finite-state machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complete classes of automata for the \(\alpha _ 0\)-product