Computational Aspects of Cellular Automata on Countable Sofic Shifts

@inproceedings{Salo2012ComputationalAO,
title={Computational Aspects of Cellular Automata on Countable Sofic Shifts},
author={Ville Salo and Ilkka T{\"o}rm{\"a}},
booktitle={MFCS},
year={2012}
}
• Published in MFCS 27 August 2012
• Mathematics
We investigate the computational properties of cellular automata on countable (equivalently, zero entropy) sofic shifts with an emphasis on nilpotency, periodicity, and asymptotic behavior. As a tool for proving decidability results, we prove the Starfleet Lemma, which is of independent interest. We present computational results including the decidability of nilpotency and periodicity, the undecidability of stability of the limit set, and the existence of a $\mathrm{\Pi}^0_1$-complete limit set…
11 Citations

Strict Asymptotic Nilpotency in Cellular Automata

The problem of which subshifts support strictly asymptotically nilpotent CA, that is, asymptonically nilpotsent CA which are not nil Potent, is discussed in some detail.

Groups and Monoids of Cellular Automata

Groups and monoids defined by cellular automata on full shifts, sofic shifts, minimal subsh shifts, countable subshifts and coded and synchronized systems are discussed.

Hard Asymptotic Sets for One-Dimensional Cellular Automata

• V. Salo
• Mathematics, Computer Science
ArXiv
• 2013
We prove that the (language of the) asymptotic set (and the nonwandering set) of a one-dimensional cellular automaton can be $\SIGMA^1_1$-hard. We do not go into much detail, since the constructions

Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2

• Mathematics
Automata
• 2014
It is proved that their conjugacy problem is complete for $$\mathsf {GI}$$, the complexity class of graph isomorphism, and that the existence problems of block maps, factor maps and embeddings are $$NP}$$-complete.

Subshifts with sparse traces Ville Salo

We study two-dimensional subshifts whose horizontal trace (a.k.a. projective subdynamics) contains only points of finite support. Our main result is a classification result for such subshifts

Subshifts with sparse traces

• V. Salo
• Mathematics
Studia Mathematica
• 2020
We study two-dimensional subshifts whose horizontal trace (a.k.a. projective subdynamics) contains only points of finite support. Our main result is a classification result for such subshifts

Constructions with Countable Subshifts of Finite Type

• Mathematics
Fundam. Informaticae
• 2013
We present constructions of countable two-dimensional subshifts of finite type SFTs with interesting properties. Our main focus is on properties of the topological derivatives and subpattern posets

Distortion element in the automorphism group of a full shift

• Mathematics
ArXiv
• 2022
We show that there is a distortion element in a finitely-generated subgroup G of the automorphism group of the full shift, namely an element of infinite order whose word norm grows

A note on subgroups of automorphism groups of full shifts

• V. Salo
• Mathematics
Ergodic Theory and Dynamical Systems
• 2016
We discuss the set of subgroups of the automorphism group of a full shift and submonoids of its endomorphism monoid. We prove closure under direct products in the monoid case and free products in the

References

SHOWING 1-6 OF 6 REFERENCES

Asymptotic behavior of dynamical systems and cellular automata

• Mathematics
• 2010
We study discrete dynamical systems through the topological concepts of limit set, which consists of all points that can be reached arbitrarily late, and asymptotic set, which consists of all

The Nilpotency Problem of One-Dimensional Cellular Automata

• J. Kari
• Mathematics
SIAM J. Comput.
• 1992
The present work proves that it is algorithmically undecidable whether a given one-dimensional cellular automaton is nilpotent, the basis of the proof of Rice's theorem for CA limit sets.

Universality of a Reversible Two-Counter Machine

• K. Morita
• Computer Science, Physics
Theor. Comput. Sci.
• 1996

An Introduction to Symbolic Dynamics and Coding

• Mathematics
• 1995
Requiring only a undergraduate knowledge of linear algebra, this first general textbook includes over 500 exercises that explore symbolic dynamics as a method to study general dynamical systems.

Structural aspects of tilings

• Computer Science
STACS
• 2008
It is shown that a tile-set that produces only periodic tilings produces only a finite number of them, and it is proved that the uncountable case may have a completely different structure.