Configuration symmetry and performance upper bound of one-dimensional cellular automata for the leader election problem

MaRDI QIDQ2814746zbMATH OpenFDO

Authors Peter Banda, Jiri Pospichal, John S. IV Caughman

Publication date 23 June 2016

Published in Journal of Cellular Automata (Search for Journal in Brave)

Full work available at URL http://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-10-number-1-2-2015/jca-10-1-2-p-1-21

zbMATH Keywords

one-dimensional cellular automatasymmetric configurationleader election problemloosely-coupled configurationupper bound performance

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80) Cell biology (92C37)

Recommendations

• Algorithms for leader election by cellular automata
• Leader election on two-dimensional periodic cellular automata
• Leader election in plane cellular automata, only with left-right global convention
• Asymptotic and numerical studies of the leader election algorithm
• The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity
• Asymptotic properties of a leader election algorithm
• Asymptotic analysis of a leader election algorithm
• Leader election in d-dimensional CA in time diam log(diam)
• The complexity of leader election in diameter-two networks

Cited in

(3)

• A study on delay-sensitive cellular automata
• On bioelectric algorithms
• A survey of cellular automata: types, dynamics, non-uniformity and applications

This page was built for publication: Configuration symmetry and performance upper bound of one-dimensional cellular automata for the leader election problem

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