The easily bored sequence (Q2676983)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The easily bored sequence |
scientific article; zbMATH DE number 7594365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The easily bored sequence |
scientific article; zbMATH DE number 7594365 |
Statements
The easily bored sequence (English)
0 references
29 September 2022
0 references
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.
0 references
integer sequences
0 references
symbolic dynamics
0 references
combinatorics on words
0 references
topological entropy
0 references
0.7316753268241882
0 references
0.6868933439254761
0 references
0.6806126832962036
0 references
0.6781731247901917
0 references
