A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the
set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state automaton …

Tree shift topological entropy - ScienceDirect Skip to main contentSkip to article Elsevier logo
Journals & Books Search RegisterSign in View PDF Download full issue Search …

We show that the limit in our definition of tree shift topological entropy is actually the infimum,
as is the case for both the topological and measure-theoretic entropies in the classical …

We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical
systems of infinite ranked trees accepted by finite tree automata. We show that, contrary to …

We study the sofic tree shifts of A Σ⁎, where Σ⁎ is a regular rooted tree of finite rank. In
particular, we give their characterization in terms of unrestricted Rabin automata. We show …

We investigate relations between the pseudo-orbit-tracing property, topological stability and
openness for tree-shifts. We prove that a tree-shift is of finite type if and only if it has the …

We generalize the notion of self-similar groups of infinite tree automorphisms to allow for
groups which are defined on a tree but may not act faithfully on it. The elements of such a …

We prove that there do not exist positively expansive cellular automata defined on the full k-
ary tree shift (for k>= 2). Moreover, we investigate some topological properties of these …

We consider the languages of finite trees called tree-shift languages which are factorial
extensible tree languages. These languages are sets of factors of subshifts of infinite trees …

LNCS 7381 - Cellular Automata on Regular Rooted Trees Page 1 Cellular Automata on
Regular Rooted Trees Tullio Ceccherini-Silberstein1, Michel Coornaert2, Francesca Fiorenzi3 …