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

Eric Goles, Diego Maldonado, Pedro Montealegre, Nicolas Ollinger. On the Computational Complexity of the Freezing Non-strict Majority Automata. In Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca, editors, Cellular Automata and Discrete Complex Systems - 23rd IFIP WG 1.5 International Workshop, AUTOMATA 2017, Milan, Italy, June 7-9, 2017, Proceedings. Volume 10248 of Lecture Notes in Computer Science, pages 109-119, Springer, 2017. [doi]

No reviews for this publication, yet.