Recommendations
Cites work
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- From relation to emulation: The covering lemma for transformation semigroups
- scientific article; zbMATH DE number 3858424 (Why is no real title available?)
- scientific article; zbMATH DE number 4135407 (Why is no real title available?)
- scientific article; zbMATH DE number 4009825 (Why is no real title available?)
- scientific article; zbMATH DE number 4011944 (Why is no real title available?)
- scientific article; zbMATH DE number 4041275 (Why is no real title available?)
- scientific article; zbMATH DE number 3451771 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3087498 (Why is no real title available?)
- On \(\alpha{}_ 0-\nu{}_ 1\)-products of automata
- Subsemigroups and complexity via the presentation lemma
- THE ABSTRACT THEORY OF AUTOMATA
Cited in
(6)- From relation to emulation: The covering lemma for transformation semigroups
- scientific article; zbMATH DE number 1268706 (Why is no real title available?)
- On the edge-independence number and edge-covering number for regular graphs
- ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK
- The completeness criterion for systems which contain all one-place finite-automaton functions
- On \(\alpha _{2} - \nu _{2}\)-products of automata
This page was built for publication: On complete systems of automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575734)
