Complete classes of automata for the _ 0-product
From MaRDI portal
DOI10.1016/0304-3975(86)90129-5zbMATH Open0619.68053OpenAlexW1538941884MaRDI QIDQ1089802FDOQ1089802
Authors: Zoltán Ésik, Pál Dömösi
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
Recommendations
productquasisuperpositioncascade compositionKrohn-Rhodes Decompositionloop-free productR-productseries-parallel composition
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cascade synthesis of finite-state machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Loop-free structure of sequential machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (12)
- On \(\alpha _ 0\)-products and \(\alpha _ 2\)-products
- Varieties of automata and transformation semigroups
- Title not available (Why is that?)
- ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Results on homomorphic realization of automata by \(\alpha_ 0\)-products
- Critical classes for the \(\alpha _ 0\)-product
- On a representation of tree automata
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Complete classes of automata for the \(\alpha _ 0\)-product
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089802)