%0 Conference Proceedings
%T Sequentializing Cellular Automata
%+ University of Turku
%+ Karlsruhe Institute of Technology (KIT)
%A Kari, Jarkko
%A Salo, Ville
%A Worsch, Thomas
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 24th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Ghent, Belgium
%Y Jan M. Baetens
%Y Martin Kutrib
%I Springer International Publishing
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-10875
%P 72-87
%8 2018-06-20
%D 2018
%R 10.1007/978-3-319-92675-9_6
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-01824875/document
%2 https://inria.hal.science/hal-01824875/file/469010_1_En_6_Chapter.pdf
%L hal-01824875
%U https://inria.hal.science/hal-01824875
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA
%~ IFIP-LNCS-10875