Computational complexity of finite asynchronous cellular automata

Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca. Computational complexity of finite asynchronous cellular automata. Theoretical Computer Science, 664:131-143, 2017. [doi]

@article{DennunzioFMMP17,
  title = {Computational complexity of finite asynchronous cellular automata},
  author = {Alberto Dennunzio and Enrico Formenti and Luca Manzoni and Giancarlo Mauri and Antonio E. Porreca},
  year = {2017},
  doi = {10.1016/j.tcs.2015.12.003},
  url = {http://dx.doi.org/10.1016/j.tcs.2015.12.003},
  researchr = {https://researchr.org/publication/DennunzioFMMP17},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {664},
  pages = {131-143},
}