Ultimate Traces of Cellular Automata - Computer Science > Formal Languages and Automata TheoryReportar como inadecuado




Ultimate Traces of Cellular Automata - Computer Science > Formal Languages and Automata Theory - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: A cellular automaton CA is a parallel synchronous computing model, whichconsists in a juxtaposition of finite automata cells whose state evolvesaccording to that of their neighbors. Its trace is the set of infinite wordsrepresenting the sequence of states taken by some particular cell. In thispaper we study the ultimate trace of CA and partial CA a CA restricted to aparticular subshift. The ultimate trace is the trace observed after a longtime run of the CA. We give sufficient conditions for a set of infinite wordsto be the trace of some CA and prove the undecidability of all properties overtraces that are stable by ultimate coincidence.



Autor: Julien Cervelle, Enrico Formenti, Pierre Guillon

Fuente: https://arxiv.org/



DESCARGAR PDF




Documentos relacionados