e/Majority problem (cellular automaton)

Information
has gloss	eng: The majority problem, or density classification task, first solved for many configurations by Gács, Kurdyumov, and Levin, is the problem of finding one-dimensional cellular automaton rules that accurately perform majority voting.
lexicalization	eng: majority problem
instance of	e/Cellular automaton