"On the Computational Complexity of the Freezing Non-strict Majority Automata."

Eric Goles et al. (2017)
a service of Schloss Dagstuhl - Leibniz Center for Informatics