The easily bored sequence
From MaRDI portal
The aim of the present paper is to study the binary sequence obtained in the process of minimizing repetitiveness at each digit choice. To this direction the author managed to construct and study a sequence called Easily Bored Sequence (EBS) similar to the Linux sequence with differences in their language and asymptotic properties and find out related topological dynamical systems as well.
Recommendations
Cites work
- Chaos on the interval
- Complexity of sequences and dynamical systems
- Dynamics of measurable functions on the interval
- Entropy for Group Endomorphisms and Homogeneous Spaces
- Entropy in dynamical systems
- Expansions of algebraic numbers
- scientific article; zbMATH DE number 6497044 (Why is no real title available?)
- scientific article; zbMATH DE number 1740032 (Why is no real title available?)
- scientific article; zbMATH DE number 2042127 (Why is no real title available?)
- scientific article; zbMATH DE number 3312496 (Why is no real title available?)
- On critical exponents in fixed points of non-erasing morphisms
- On the topological entropy of continuous and almost continuous functions
- Sur un théorème de Thue
- The dynamics of a typical measurable function are determined on a zero measure set
- The Linus sequence
- Topological entropy and equivalence of dynamical systems
This page was built for publication: The easily bored sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676983)