Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata

Jérôme Olivier Durand-Lose. Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata. In Ricardo A. Baeza-Yates, Eric Goles Ch., Patricio V. Poblete, editors, LATIN 95: Theoretical Informatics, Second Latin American Symposium, Valparaíso, Chile, April 3-7, 1995, Proceedings. Volume 911 of Lecture Notes in Computer Science, pages 230-244, Springer, 1995.

@inproceedings{Durand-Lose95,
  title = {Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata},
  author = {Jérôme Olivier Durand-Lose},
  year = {1995},
  tags = {partitioning},
  researchr = {https://researchr.org/publication/Durand-Lose95},
  cites = {0},
  citedby = {0},
  pages = {230-244},
  booktitle = {LATIN  95: Theoretical Informatics, Second Latin American Symposium, Valparaíso, Chile, April 3-7, 1995, Proceedings},
  editor = {Ricardo A. Baeza-Yates and Eric Goles Ch. and Patricio V. Poblete},
  volume = {911},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-59175-3},
}