Results 31 to 40 of about 19,048 (257)
, 2021 This chapter presents some of the links between automata theory and symbolic dynamics. The emphasis is on two particular points. The first one is the interplay between some particular classes of automata, such as local automata and results on embeddings of shifts of finite type.
Béal, Marie-Pierre +3 more
openaire +3 more sources
Blind System Identification in Noise Using a Dynamic-Based Estimator
IEEE Access, 2021 In this work we consider the problem of blind system identification in noise driven by an independent and identically distributed (i.i.d) non-Gaussian signal generated from a deterministic nonlinear chaotic system.
Sumona Mukhopadhyay +2 more
doaj +1 more source
Infinite Traces and Symbolic Dynamics
Theory of Computing Systems, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wit Forys, Piotr Oprocha
openaire +3 more sources
Unsupervised Symbolization of Signal Time Series for Extraction of the Embedded Information
Entropy, 2017 This paper formulates an unsupervised algorithm for symbolization of signal time series to capture the embedded dynamic behavior. The key idea is to convert time series of the digital signal into a string of (spatially discrete) symbols from which the ...
Yue Li, Asok Ray
doaj +1 more source
Forbidden Words in Symbolic Dynamics
Advances in Applied Mathematics, 2000 This paper is devoted to a new topological invariant for symbolic dynamics. One of the classical ways of describing a symbolic dynamical system is by using forbidden words. The authors introduce an equivalence relation \(\simeq\) between functions from \(\mathbb{N}\) to \(\mathbb{N}\). Using forbidden words, the authors prove that any equivalence class
BÉAL M. P. +3 more
openaire +3 more sources
Discrete rotations and symbolic dynamics
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Berthe, Valerie, Nouvel, Bertrand
openaire +3 more sources
On the Entropy of a Two Step Random Fibonacci Substitution
Entropy, 2013 We consider a random generalization of the classical Fibonacci substitution. The substitution we consider is defined as the rule mapping, a → baa and b → ab, with probability , and → ba, with probability 1 – p for 0 < p < 1, and where the random rule is
Johan Nilsson
doaj +1 more source
Fractal and Fractional, 2022 Hidden attractors are associated with multistability phenomena, which have considerable application prospects in engineering. By modifying a simple three-dimensional continuous quadratic dynamical system, this paper reports a new autonomous chaotic ...
Chengwei Dong
doaj +1 more source
Subshifts on Infinite Alphabets and Their Entropy
Entropy, 2020 We analyze symbolic dynamics to infinite alphabets by endowing the alphabet with the cofinite topology. The topological entropy is shown to be equal to the supremum of the growth rate of the complexity function with respect to finite subalphabets.
Sharwin Rezagholi
doaj +1 more source
Newton’s method and symbolic dynamics [PDF]
Proceedings of the American Mathematical Society, 1984 The starting point of the paper is a result by B. Barna stating the convergence of Newton's method to a root of a polynomial, except for a set of initial points homeomorphic to a Cantor set. The assumptions of Barna's theorem are that: (1) the polynomial has degree at least four; (2) all the roots are real, distinct, and simple.
openaire +2 more sources