Universal asynchronous iterative arrays of Mealy automata

DOI10.1007/BF00288646zbMath0414.68025MaRDI QIDQ599501

Hans Kleine Büning, Lutz Priese

Publication date: 1980

Published in: Acta Informatica (Search for Journal in Brave)

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)

Related Items (2)

How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory? ⋮ FILTRONS AND THEIR ASSOCIATED RING COMPUTATIONS

Cites Work

• Über Möglichkeiten zur Simulation Endlicher Automaten durch eine Art Sequentieller Netzwerke aus einfachen Bausteinen
• 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
• Towards a Theory of Universal Speed-Independent Modules
• Simple Computation-Universal Cellular Spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item

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