## Abstract We investigate computable subshifts and the connection with effective symbolic dynamics. It is shown that a decidable Π^0^~1~ class __P__ is a subshift if and only if there exists a computable function __F__ mapping 2^ℕ^ to 2^ℕ^ such that __P__ is the set of itineraries of elements of 2
✦ LIBER ✦
β-Expansions and symbolic dynamics
✍ Scribed by F. Blanchard
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 574 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Computable symbolic dynamics
✍
Douglas Cenzer; S. Ali Dashti; Jonathan L. F. King
📂
Article
📅
2008
🏛
John Wiley and Sons
🌐
English
⚖ 149 KB
Symbolic dynamics and relaxation oscilla
✍
John Guckenheimer
📂
Article
📅
1980
🏛
Elsevier Science
🌐
English
⚖ 648 KB
Isolating segments and symbolic dynamics
✍
K. Wójcik
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 118 KB
Infinite Traces and Symbolic Dynamics
✍
Wit Foryś; Piotr Oprocha
📂
Article
📅
2007
🏛
Springer
🌐
English
⚖ 401 KB
The Conley index and symbolic dynamics
✍
Andrzej Szymczak
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 870 KB
Forbidden Words in Symbolic Dynamics
✍
M.-P Béal; F Mignosi; A Restivo; M Sciortino
📂
Article
📅
2000
🏛
Elsevier Science
🌐
English
⚖ 209 KB
We introduce an equivalence relation , between functions from ގ to .ގ By describing a symbolic dynamical system in terms of forbidden words, we prove that the ,-equivalence class of the function that counts the minimal forbidden words of a system is a topological invariant of the system. We show