The Firing Squad Synchronization Problem in Defective Cellular Automata

スポンサーリンク

概要

• 論文の詳細を見る

• The firing squad synchronization problem is considered for defective cellular automata. A lower bound of time t_f for the problem is derived. The state complexity to solve the problem is investigated and it is shown that the state set has to be arbitrary large to obtain solutions of time complexity O(n). For memory-augmented defective cellular automata a t_f -time solution is given.

• 社団法人電子情報通信学会の論文
• 1995-07-25

著者

• Kutrib M

  Univ. Giessen Giessen Deu

• Kutrib Martin

  University of Giessen, AG Informatik, Arndtstr

• Vollmar Roland

  University of Karlsruhe, Am Fasanengarten

• Vollmar Roland

  University Of Karlsruhe Am Fasanengarten

関連論文

• The Firing Squad Synchronization Problem in Defective Cellular Automata

スポンサーリンク