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]

@inproceedings{GolesMMO17,
  title = {On the Computational Complexity of the Freezing Non-strict Majority Automata},
  author = {Eric Goles and Diego Maldonado and Pedro Montealegre and Nicolas Ollinger},
  year = {2017},
  doi = {10.1007/978-3-319-58631-1_9},
  url = {https://doi.org/10.1007/978-3-319-58631-1_9},
  researchr = {https://researchr.org/publication/GolesMMO17},
  cites = {0},
  citedby = {0},
  pages = {109-119},
  booktitle = {Cellular Automata and Discrete Complex Systems - 23rd IFIP WG 1.5 International Workshop, AUTOMATA 2017, Milan, Italy, June 7-9, 2017, Proceedings},
  editor = {Alberto Dennunzio and Enrico Formenti and Luca Manzoni and Antonio E. Porreca},
  volume = {10248},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-58631-1},
}