Fault tolerant cellular spaces

DOI10.1016/S0022-0000(75)80065-1zbMath0319.94029DBLPjournals/jcss/NishioK75WikidataQ60308395 ScholiaQ60308395MaRDI QIDQ1223067

Hidenosuke Nishio, Youichi Kobuchi

Publication date: 1975

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

Mathematics Subject Classification ID

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

Related Items (12)

Sampling Algorithms for Discrete Markov Random Fields and Related Graphical Models ⋮ Reliable computation with cellular automata ⋮ Cutting the Firing Squad Synchronization ⋮ 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 ⋮ Fault-tolerant schemes for some systolic systems ⋮ FAULT-TOLERANT NANOCOMPUTERS BASED ON ASYNCHRONOUS CELLULAR AUTOMATA ⋮ Fault tolerant cellular automata ⋮ (A-)synchronous (non)-deterministic cell spaces simulating each other ⋮ Nature-Based Problems in Cellular Automata

Cites Work

• Structural and behavioral equivalences of tessellation automata

This page was built for publication: Fault tolerant cellular spaces