| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Sequentializing Cellular Automata
Abstract : We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be written as a single left-to-right sweep of a bijective rule from left to right over an infinite tape.
Cited literature [4 references]
https://hal.inria.fr/hal-01824875
Contributor : Hal Ifip <>
Submitted on : Wednesday, June 27, 2018 - 4:37:55 PM
Last modification on : Wednesday, August 29, 2018 - 11:02:02 AM
Long-term archiving on: : Thursday, September 27, 2018 - 4:32:51 AM
Contributor : Hal Ifip <>
Submitted on : Wednesday, June 27, 2018 - 4:37:55 PM
Last modification on : Wednesday, August 29, 2018 - 11:02:02 AM
Long-term archiving on: : Thursday, September 27, 2018 - 4:32:51 AM
File
469010_1_En_6_Chapter.pdf
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution 4.0 International License