Skip to main content
Conference ProceedingsOPEN ACCESS

Sequentializing cellular automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2018) 10875 LNCS 72-87
DOI: 10.1007/978-3-319-92675-9_6
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Kari, J., Salo, V., & Worsch, T. (2018). Sequentializing cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10875 LNCS, pp. 72–87). Springer Verlag. https://doi.org/10.1007/978-3-319-92675-9_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free