Universal asynchronous iterative arrays of Mealy automata

DOI10.1007/BF00288646MaRDI QIDQ599501zbMATH OpenFDO

Authors Hans Kleine Büning, Lutz Priese

Publication date 1980

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00288646

zbMATH Keywords

asynchronous networkdelay-free simulation of finite state machineshomogeneous iterative arraysuniversal Mealy automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Circuits, networks (94C99) Cellular automata (computational aspects) (68Q80)

Cites work

• scientific article; zbMATH DE number 3513699 (Why is no real title available?)
• scientific article; zbMATH DE number 3450106 (Why is no real title available?)
• scientific article; zbMATH DE number 3338162 (Why is no real title available?)
• A Combinatorial Approach to Self-Correction
• On the Minimal Complexity of Component-Machines for Self-Correcting Networks
• Reversible Automaten und Einfache Universelle 2‐Dimensionale Thue‐Systeme
• Simple Computation-Universal Cellular Spaces
• Towards a Theory of Universal Speed-Independent Modules
• Über Möglichkeiten zur Simulation Endlicher Automaten durch eine Art Sequentieller Netzwerke aus einfachen Bausteinen

Cited in

(2)

• How can we construct reversible machines out of reversible logic element with memory?
• FILTRONS AND THEIR ASSOCIATED RING COMPUTATIONS

This page was built for publication: Universal asynchronous iterative arrays of Mealy automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q599501)