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.




Cited in
(1)








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)