Universal asynchronous iterative arrays of Mealy automata

DOI10.1007/BF00288646zbMATH Open0414.68025MaRDI QIDQ599501FDOQ599501

Authors: 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)

Cites Work

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

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)