Cellular Automata on Group Sets and the Uniform Curtis-Hedlund-Lyndon Theorem

Simon Wacker. Cellular Automata on Group Sets and the Uniform Curtis-Hedlund-Lyndon Theorem. In Matthew Cook 0001, Turlough Neary, editors, Cellular Automata and Discrete Complex Systems - 22nd IFIP WG 1.5 International Workshop, AUTOMATA 2016, Zurich, Switzerland, June 15-17, 2016, Proceedings. Volume 9664 of Lecture Notes in Computer Science, pages 185-198, Springer, 2016. [doi]

@inproceedings{Wacker16,
  title = {Cellular Automata on Group Sets and the Uniform Curtis-Hedlund-Lyndon Theorem},
  author = {Simon Wacker},
  year = {2016},
  doi = {10.1007/978-3-319-39300-1_15},
  url = {http://dx.doi.org/10.1007/978-3-319-39300-1_15},
  researchr = {https://researchr.org/publication/Wacker16},
  cites = {0},
  citedby = {0},
  pages = {185-198},
  booktitle = {Cellular Automata and Discrete Complex Systems - 22nd IFIP WG 1.5 International Workshop, AUTOMATA 2016, Zurich, Switzerland, June 15-17, 2016, Proceedings},
  editor = {Matthew Cook 0001 and Turlough Neary},
  volume = {9664},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-39299-8},
}