Fault tolerant cellular spaces

DOI10.1016/S0022-0000(75)80065-1MaRDI QIDQ1223067zbMATH OpenDBLPWikidataFDO

Authors Hidenosuke Nishio, Youichi Kobuchi

Publication date 1975

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

Full work available at URL https://doi.org/10.1016/S0022-0000(75)80065-1

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General biology and biomathematics (92B05)

Cites work

• Structural and behavioral equivalences of tessellation automata

Cited in

(12)

• Reliable computation with cellular automata
• Fault tolerant cellular automata
• (A-)synchronous (non)-deterministic cell spaces simulating each other
• Nature-based problems in cellular automata
• Fault-tolerant schemes for some systolic systems
• Cutting the Firing Squad Synchronization
• FAULT-TOLERANT NANOCOMPUTERS BASED ON ASYNCHRONOUS CELLULAR AUTOMATA
• Sampling Algorithms for Discrete Markov Random Fields and Related Graphical Models
• Revisiting the cutting of the firing squad synchronization
• State-efficient realization of fault-tolerant FSSP algorithms
• A survey of cellular automata: types, dynamics, non-uniformity and applications
• Shrinking one-way cellular automata

This page was built for publication: Fault tolerant cellular spaces

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