Papers
Topics
Authors
Recent
2000 character limit reached

One-dimensional cellular automata with a unique active transition (2411.03601v3)

Published 6 Nov 2024 in nlin.CG, cs.FL, and math.DS

Abstract: A one-dimensional cellular automaton $\tau : A\mathbb{Z} \to A\mathbb{Z}$ is a transformation of the full shift defined via a finite neighborhood $S \subset \mathbb{Z}$ and a local function $\mu : AS \to A$. We study the family of cellular automata whose finite neighborhood $S$ is an interval containing $0$, and there exists a pattern $p \in AS$ satisfying that $\mu(z) = z(0)$ if and only if $z \neq p$; this means that these cellular automata have a unique \emph{active transition}. Despite its simplicity, this family presents interesting and subtle problems, as the behavior of the cellular automaton completely depends on the structure of $p$. We show that every cellular automaton $\tau$ with a unique active transition $p \in AS$ is either idempotent or strictly almost equicontinuous, and we completely characterize each one of these situations in terms of $p$. In essence, the idempotence of $\tau$ depends on the existence of a certain subpattern of $p$ with a translational symmetry.

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.