Efficient 1-bit-communication cellular algorithms

MaRDI QIDQ4666756zbMATH OpenFDO

Authors Koshi Michisaka, Naoki Kamikawa, Yuichi Kinugasa, Hiroshi Umeo

Publication date 5 April 2005

zbMATH Keywords

cell communicationscelluar automatadiscrete event systemsearly bird problemfiring squad synchroization problemsequence generation problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Communication networks in operations research (90B18) Discrete event control/observation systems (93C65)

Review text

The authors propose some algorithms for (a new class of) celluar automata having 1-bit cell communications. Here, the number of internal states is assumed to be finite. Transitions are possible to neighbouring states only. Whitin this framework, a sequence generation problem, a firing squad synchronization problem and an early bird problem are studied in great detail. For the entire collection see [Zbl 1054.93003].

Recommendations

• 1-bit inter-cell communication cellular algorithms.
• scientific article; zbMATH DE number 5190413
• Problem solving on one-bit-communication cellular automata
• A synchronization problem on 1-bit communication cellular automata
• scientific article; zbMATH DE number 1886333

Cited in

(8)

• Regular biosequence pattern matching with cellular automata
• 1-bit inter-cell communication cellular algorithms.
• Problem solving on one-bit-communication cellular automata
• scientific article; zbMATH DE number 5190413 (Why is no real title available?)
• scientific article; zbMATH DE number 3984577 (Why is no real title available?)
• scientific article; zbMATH DE number 1886333 (Why is no real title available?)
• All-to-all communication with CA agents by active coloring and acknowledging
• Algorithms with active cells modeled by cellular automata with write-access (CA-w)

This page was built for publication: Efficient 1-bit-communication cellular algorithms

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