Results 11 to 20 of about 26,862 (284)
The expressiveness of quasiperiodic and minimal shifts of finite type [PDF]
Ergodic Theory and Dynamical Systems, 2020 We study multidimensional minimal and quasiperiodic shifts of finite type. We prove for these classes several results that were previously known for the shifts of finite type in general, without restriction. We show that some quasiperiodic shifts of finite type admit only non-computable configurations; we characterize the classes of Turing degrees that
Durand, Bruno, Romashchenko, Andrei
openaire +6 more sources
Intermediate $\beta$-shifts of finite type [PDF]
Discrete and Continuous Dynamical Systems, 2016 An aim of this article is to highlight dynamical differences between the greedy, and hence the lazy, $\beta$-shift (transformation) and an intermediate $\beta$-shift (transformation), for a fixed $\beta \in (1, 2)$. Specifically, a classification in terms of the kneading invariants of the linear maps $T_{\beta,\alpha} \colon x \mapsto \beta x + \alpha \
Li, Bing, Sahlsten, Tuomas, Samuel, Tony
openaire +6 more sources
Denseness of intermediate 𝛽-shifts of finite-type [PDF]
Proceedings of the American Mathematical Society, 2019 We determine the structure of the set of intermediate β \beta
Li, Bing +4 more
openaire +5 more sources
Fiber-Mixing Codes between Shifts of Finite Type and Factors of Gibbs Measures [PDF]
Entropy, 2016 A sliding block code π : X → Y between shift spaces is called fiber-mixing if, for every x and x ′ in X with y = π ( x ) = π ( x ′ ) , there is z ∈ π - 1 ( y ) which is left asymptotic to x and right asymptotic ...
Uijin Jung
doaj +2 more sources
The zeta function of a periodic-finite-type shift [PDF]
2009 IEEE International Symposium on Information Theory, 2009 The class of periodic-finite-type shifts (PFT's) is a class of sofic shifts that strictly includes the class of shifts of finite type (SFT's), and the zeta function of a PFT is a generating function for the number of periodic sequences in the shift. In this paper, we derive a useful formula for the zeta function of a PFT.
Navin Kashyap, Akiko Manada
core +7 more sources
Shifts of finite type and Fibonacci Harps [PDF]
Applied Mathematics Letters, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Annalisa Crannell +2 more
openaire +2 more sources
Weak equivalence for shifts of finite type [PDF]
Indagationes Mathematicae, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barth, Joseph, Dykstra, Andrew
openaire +2 more sources
Sofic and Almost of Finite Type Tree-Shifts [PDF]
, 2010 We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of infinite sequences, there is no unique minimal deterministic irreducible tree automaton accepting an irreducible sofic tree-shift, but that there is a unique synchronized ...
Aubrun, Nathalie, Béal, Marie-Pierre
core +7 more sources
On some new invariants for shift equivalence for shifts of finite type [PDF]
Journal of Number Theory, 2012 We introduce a new computable invariant for strong shift equivalence of shifts of finite type. The invariant is based on an invariant introduced by Trow, Boyle, and Marcus, but has the advantage of being readily computable. We summarize briefly a large-scale numerical experiment aimed at deciding strong shift equivalence for shifts of finite type given
Eilers, Søren, Kiming, Ian
openaire +7 more sources
The Rohlin property for shifts of finite type [PDF]
Journal of Functional Analysis, 2005 22 pages, 3 ...
Holton, Charles G.
openaire +4 more sources