Results 1 to 10 of about 26,098 (150)
On Normality in Shifts of Finite Type [PDF]
Theory of Computing Systems, 2019 In this paper we consider the notion of normality of sequences in shifts of finite type. A sequence is normal if the frequency of each block exists and is equal to the Parry measure of the block. We give a characterization of normality in terms of incompressibility by lossless transducers. The result was already known in the case of the full shift.
Olivier Carton, Carton Olivier
exaly +3 more sources
Theoretical Computer Science, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aubrun, Nathalie, Béal, Marie-Pierre
exaly +4 more sources
Bulletin of the Brazilian Mathematical Society, 2022 The aim of this article is to find appropriate definitions for shifts of finite type and sofic shifts in a general context of symbolic dynamics. We start showing that the classical definitions of shifts of finite type and sofic shifts, as they are given in the context of finite-alphabet shift spaces on the one-dimensional monoid $\mathbb{N}$ or ...
Marcelo Sobottka
exaly +4 more sources
Tree-shifts: the entropy of tree-shifts of finite type [PDF]
Nonlinearity, 2017 This paper studies the entropy of tree-shifts of finite type with and without boundary conditions. We demonstrate that computing the entropy of a tree-shift of finite type is equivalent to solving a system of nonlinear recurrence equations. Furthermore, the entropy of the binary Markov tree-shifts over two symbols is either $0$ or $\ln 2$.
Ban, Jung-Chao, Chang, Chih-Hung
exaly +5 more sources
Nonextensive Statistics in Nanoscopic Quantum Dots [PDF]
NanomaterialsNanoscopic quantum dots exhibit discrete energy spectra and size- and shape-dependent thermal properties that cannot always be adequately described within the conventional Boltzmann–Gibbs statistical framework.
John A. Gil-Corrales +2 more
doaj +2 more sources
Shifts of finite type and random substitutions [PDF]
Discrete and Continuous Dynamical Systems, 2019 We prove that every topologically transitive shift of finite type in one dimension is topologically conjugate to a subshift arising from a primitive random substitution on a finite alphabet. As a result, we show that the set of values of topological entropy which can be attained by random substitution subshifts contains all Perron numbers and so is ...
Philipp Gohlke, Dan Rust
exaly +4 more sources
A weak equivalence between shifts of finite type
Advances in Applied Mathematics, 2002 Shifts of finite type \(S\), \(T\) are here called weakly equivalent if there are finite alphabets \(A\) and \(B\) with \(S\subset A^{\mathbb{Z}}\) and \(T\subset B^{\mathbb{Z}}\) and sliding block codes \(f:A^{\mathbb{Z}}\to B^{\mathbb{Z}}\), \(g:B^{\mathbb{Z}}\to A^{\mathbb{Z}}\) with \(S=f^{-1}(T)\) and \(R=g^{-1}(S)\).
Béal, Marie-Pierre, Perrin, Dominique
exaly +4 more sources
Recurrence rates for shifts of finite type
Advances in MathematicsLet $Σ_{A}$ be a topologically mixing shift of finite type, let $σ:Σ_{A}\toΣ_{A}$ be the usual left-shift, and let $μ$ be the Gibbs measure for a Hölder continuous potential that is not cohomologous to a constant. In this paper we study recurrence rates for the dynamical system $(Σ_{A},σ)$ that hold $μ$-almost surely. In particular, given a function $ψ:
Balázs Barany, Simon Baker
exaly +3 more sources
On graph induced symbolic systems
Applied General Topology, 2023 In this paper, we investigate shift spaces arising from a multidimensional graph G. In particular, we investigate nonemptiness and existence of periodic points for a multidimensional shift space.
Prashant Kumar, Puneet Sharma
doaj +1 more source
On the Irreducibility of Certain Shifts of Finite Type
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2013 Akiko Manada +2 more
exaly +2 more sources