Towards a Theory of Universal Speed-Independent Modules
From MaRDI portal
Publication:4404136
DOI10.1109/T-C.1974.223773zbMATH Open0277.94021OpenAlexW1981519869MaRDI QIDQ4404136FDOQ4404136
Authors: Robert M. Keller 
Publication date: 1974
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/t-c.1974.223773
Cited In (14)
- Implementation of Deadlock Analysis in Data Flow Graphs
- Characterization of random fluctuation-based computation in cellular automata
- A note on asynchronous cellular automata
- Universal asynchronous iterative arrays of Mealy automata
- How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory?
- Fluctuation-driven computing on number-conserving cellular automata
- Delay-insensitive computation in asynchronous cellular automata
- Automata and concurrency
- Construction universality in purely asynchronous cellular automata
- A comprehensive taxonomy of cellular automata
- Effect of random fluctuations on minimizing the complexity of universal asynchronous cellular automata
- Emergence of universal global behavior from reversible local transitions in asynchronous systems
- Modular implementation of concurrency
- On a fast decomposition method in some models of concurrent computations
This page was built for publication: Towards a Theory of Universal Speed-Independent Modules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4404136)
