Abstract
The purpose of this course is to introduce some notions of entropy: entropy in information theory, entropy of a curve and topological and measure-theoretic entropies. For these last two notions, we will consider in particular dynamical symbolical systems in order to present some measures of disorder for sequences. We will allude then to the problem of classification of sequences with respect to their spectral properties thanks to the entropy. For this purpose, we will introduce the sequence of block entropies for sequences taking their values in a finite alphabet: we will then compute explicitely the block frequencies (or in other words, the measure of the associated dynamical system) for some examples of automatic sequences (Prouhet-Thue-Morse, paperfolding and Rudin-Shapiro sequences) and for Sturmian sequences (these are the sequences with minimal complexity among all non-ultimately periodic sequences; in particular, we will consider some generalized Fibonacci sequences). But, in order to understand the intuitive meaning of the notions of topological and measure-theoretic entropies, we will begin by defining the Shannon entropy of an experiment.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
