A note on asynchronous cellular automata

DOI10.1016/0022-0000(78)90007-7zbMATH Open0396.68039OpenAlexW2032288209MaRDI QIDQ1253544FDOQ1253544

Authors: Lutz Priese 

Publication date: 1978

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(78)90007-7

zbMATH Keywords

Asynchronous Cellular AutomataGeneralized Thue-Systems

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Thue and Post systems, etc. (03D03)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Simple Computation-Universal Cellular Spaces
• Title not available (Why is that?)
• Towards a Theory of Universal Speed-Independent Modules
• A Combinatorial Approach to Self-Correction
• Reversible Automaten und Einfache Universelle 2‐Dimensionale Thue‐Systeme
• Title not available (Why is that?)
• ON A SIMPLE COMBINATORIAL STRUCTURE SUFFICIENT FOR SYBLYING NONTRIVIAL SELF-REPRODUCTION
• Overlapping algorithms
• Cell space approaches in biomathematics

Cited In (6)

• (A-)synchronous (non)-deterministic cell spaces simulating each other
• Delay-insensitive computation in asynchronous cellular automata
• Construction universality in purely asynchronous cellular automata
• A comprehensive taxonomy of cellular automata
• FAULT-TOLERANT NANOCOMPUTERS BASED ON ASYNCHRONOUS CELLULAR AUTOMATA
• Modular implementation of concurrency

This page was built for publication: A note on asynchronous cellular automata

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