ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK
From MaRDI portal
Publication:4658708
Recommendations
Cites work
- scientific article; zbMATH DE number 4070321 (Why is no real title available?)
- scientific article; zbMATH DE number 711039 (Why is no real title available?)
- scientific article; zbMATH DE number 3223684 (Why is no real title available?)
- scientific article; zbMATH DE number 3363435 (Why is no real title available?)
- Analysis and identification of speed-independent circuits on an event model
- Complete classes of automata for the \(\alpha _ 0\)-product
- Computation of Boolean functions on networks of binary automata
- Computation on binary tree-networks
- Delay-insensitivity and ternary simulation
- On complete systems of automata
- Parallel calculation of a linear mapping on a computer network
- Parallel realization of permutations over trees
- Permutation Factorization on Star-Connected Networks of Binary Automata
Cited in
(4)
This page was built for publication: ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4658708)