Towards a Theory of Universal Speed-Independent Modules

DOI10.1109/T-C.1974.223773zbMath0277.94021OpenAlexW1981519869MaRDI QIDQ4404136

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (13)

Characterization of random fluctuation-based computation in cellular automata ⋮ On a fast decomposition method in some models of concurrent computations ⋮ Construction universality in purely asynchronous cellular automata ⋮ Implementation of Deadlock Analysis in Data Flow Graphs ⋮ 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 ⋮ Emergence of universal global behavior from reversible local transitions in asynchronous systems ⋮ Delay-insensitive computation in asynchronous cellular automata ⋮ A note on asynchronous cellular automata ⋮ Effect of random fluctuations on minimizing the complexity of universal asynchronous cellular automata ⋮ Modular implementation of concurrency ⋮ Automata and concurrency

This page was built for publication: Towards a Theory of Universal Speed-Independent Modules