Sofic Trace Subshift of a Cellular Automaton

Authors:
Julien Cervelle;Enrico Formenti;Pierre Guillon
Affiliations:
Institut Gaspard Monge, Université de Marne la Vallée, 77454 Marne la Vallée Cedex 2, France;Laboratoire I3S, Université de Nice-Sophia Antipolis, 2000 Route des Lucioles, 06903 Sophia Antipolis, France;Institut Gaspard Monge, Université de Marne la Vallée, 77454 Marne la Vallée Cedex 2, France
Venue:
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Year:
2007

Citing 4
Cited 2

Undecidability of CA classification schemes

Complex Systems
Pattern growth in elementary cellular automata

Theoretical Computer Science
An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
Kolmogorov complexity and cellular automata classification

Theoretical Computer Science

Nilpotency and Limit Sets of Cellular Automata

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Towards a rice theorem on traces of cellular automata

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. In this paper we study conditions for a sofic subshift to be the trace of a cellular automaton.