Predavatelj: prof. dr. Jean-Paul Allouche (Université Pierre et Marie Curie, Pariz, Francija)
Automatic sequences can be defined either from a purely
combinatorial point of view or from a theoretical computer science point of view.
Namely they can be defined either by means of the finiteness of a specific set of
their subsequences or as deterministic sequences generated by a specific kind of
algorithm (finite automata). Thanks to this double aspect, they can be found in or
applied to many fields: mathematics (number theory, real analysis, fractals…) or
theoretical computer science (combinatorics on words, morphism of the free
monoid…), but also physics (one dimensional Ising model, quasi-crystals…), and
even economics, games, and music.
combinatorial point of view or from a theoretical computer science point of view.
Namely they can be defined either by means of the finiteness of a specific set of
their subsequences or as deterministic sequences generated by a specific kind of
algorithm (finite automata). Thanks to this double aspect, they can be found in or
applied to many fields: mathematics (number theory, real analysis, fractals…) or
theoretical computer science (combinatorics on words, morphism of the free
monoid…), but also physics (one dimensional Ising model, quasi-crystals…), and
even economics, games, and music.
