The results presented in this talk are based on a joint work with
Marie-Pierre B´eal (Univ. Paris-Est) and Sylvain Lombardy (Univ. Bordeaux)
published in Proc. of CSR 2006.
The complete journal version is still in preparation.
Some of the results have been included in the chapter
Rational and recognizable series
of the Handbook of Weighted Automata, Springer, 2009.
Develop automata theory inside a restricted set of words
(typically the factors of a shift)
Find classes of shifts for which some problems are simpler
(examples below).
Find natural generalizations of classes like Sturmian shifts
(like normal sets below).
Understand the role played by free groups in symbolic systems
(Sturmian or interval exchange shifts).
Biological motivation
• Mathematical setup
• Examples and prior results
• Regular splicing languages
• regular splicing languages must have a constant
• it is decidable whether a given regular language
is splicing
• Open (characterization, circular splicing languages)
Multidimensional Symbolic Dynamics is the extension to Z2 and Zn of
(classical) symbolic dynamics.
We are still interested in shifts of finite type, sofic shifts, and factor
maps (among others).