Sequentializing cellular automata

DOI10.1007/978-3-319-92675-9_6MaRDI QIDQ6297947arXivWikidataFDO

Authors Jarkko Kari, Ville Salo, Thomas Worsch

Publication date 19 February 2018

Published in arXiv

Full work available at URL https://doi.org/10.1007/978-3-319-92675-9_6

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

arXiv classification

cs.FLmath.DS

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.

This page was built for publication: Sequentializing cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6297947)