Year: 1998
Type: article
Abstract: Given a (finite but arbitrarily long) string of zeros and ones, we report a way to determine if the number of ones is less than, greater than, or equal to a prescribed number by applying two sets of cellular automaton rules in succession. Thus, we solve the general one-dimensional density classification problem using two cellular automata.
Authors: H. F. Chau, K. K. Yan, K. Y. Wan, L. W. Siu
Institution: University of Hong Kong
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1992031257
