Skip to main content
Conference Proceedings

Towards a rice theorem on traces of cellular automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4708 LNCS 310-319
DOI: 10.1007/978-3-540-74456-6_29
8Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. We prove the undecidability of a rather large class of problems over trace subshifts of cellular automata. © Springer-Verlag Berlin Heidelberg 2007.

Author supplied keywords

Cite

CITATION STYLE

APA

Cervelle, J., & Guillon, P. (2007). Towards a rice theorem on traces of cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4708 LNCS, pp. 310–319). Springer Verlag. https://doi.org/10.1007/978-3-540-74456-6_29

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