Towards a Theory of Universal Speed-Independent Modules

DOI10.1109/T-C.1974.223773MaRDI QIDQ4404136zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(14)

• On a fast decomposition method in some models of concurrent computations
• Construction universality in purely asynchronous cellular automata
• How can we construct reversible machines out of reversible logic element with memory?
• A note on asynchronous cellular automata
• Automata and concurrency
• Implementation of Deadlock Analysis in Data Flow Graphs
• A comprehensive taxonomy of cellular automata
• Effect of random fluctuations on minimizing the complexity of universal asynchronous cellular automata
• Characterization of random fluctuation-based computation in cellular automata
• Modular implementation of concurrency
• Emergence of universal global behavior from reversible local transitions in asynchronous systems
• Fluctuation-driven computing on number-conserving cellular automata
• Universal asynchronous iterative arrays of Mealy automata
• Delay-insensitive computation in asynchronous cellular automata

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)