ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK
DOI10.1142/S0218196704002043zbMATH Open1088.68127MaRDI QIDQ4658708FDOQ4658708
Authors: Chrystopher L. Nehaniv
Publication date: 18 March 2005
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Recommendations
local timeDiscrete dynamical systemsgeneralized cellular automata and networksproducts of automata over locally finite digraphs
Applications of graph theory (05C90) Cellular automata (computational aspects) (68Q80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
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?)
- On complete systems of automata
- Complete classes of automata for the \(\alpha _ 0\)-product
- Computation on binary tree-networks
- Computation of Boolean functions on networks of binary automata
- Parallel calculation of a linear mapping on a computer network
- Parallel realization of permutations over trees
- Analysis and identification of speed-independent circuits on an event model
- Delay-insensitivity and ternary simulation
- 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)