Describing the Set of Words Generated by Interval Exchange Transformation

REFERENCES

• Belov , A. Ya. , Borisenko , V. V. , Latyshev , V. N. ( 2002 ). Monomial algebras . Itogi Nauki i Tekhniki. Sovr. Mat. Pril., Tem. Obzory . Vol. 26 ( Algebra IV ), Moscow , pp. 35 – 214 ( Russian ).
   Google Scholar
• Belov , A. Ya. , Kondakov , G. V. ( 1995 ). Inverse problems of symbolic dynamics . Fundamental and Applied Mathematics 1 : 71 – 79 .
   Google Scholar
• Belov , A. Ya. , Chernyat'ev , A. L. ( 1999 ). Describing Sturmian words over an n-letter alphabet . Math. Met. Appl. IV, MGSU 122 – 128 .
   Google Scholar
• Belov , A. Ja. , Cherniatiev , A. L. ( 2008 ). Words with low complexity and interval exchange transformations . Uspehi Mat. Nauk 63 : 159 – 160 .
   Google Scholar
• Belov , A. Ja. , Cherniatiev , A. L. Words with low complexity and interval exchange transformations. Dep. VINITI, No 1048-B2007 from 09.11.07 (Russian).
   Google Scholar
• Sinai , Ya. G. ( 1977 ). Introduction to Ergodic Theory . Princeton , NJ : Princeton Univ. Press .
   Google Scholar
• Chernyat'ev , A. L. ( 2007 ). Balanced words and dynamical systems . Fundamental and Applied Mathematics 13 : 213 – 224 .
   Google Scholar
• Chernyat'ev , A. L. ( 2008 ). Words with minimal growth function . Vestnik Mosk. Gos. Univ. Moscow University Mathematics Bulletin 63 ( 6 ): 262 – 264 .
   Google Scholar
• Aberkane , A. ( 2003 ). Words whose complexity satisfies lim p(n)/n = 1 . Theor. Comp. Sci. 307 : 31 – 46 .
   Google Scholar
• Arnoux , P. , Rauzy , G. ( 1991 ). Representation geometrique des suites the complexite 2n + 1 . Bull. Soc. Math. France 119 : 199 – 215 .
   Google Scholar
• Balázi , P. ( 2003 ). Infnite words coding three-interval exchange . Diploma work CTU.
   Google Scholar
• Balázi , P. ( 2003 ). Substitution properties of ternary words coding 3-interval exchange . In: Harju , T. , Karhumdpaki , J. , eds. Proceedings WORDS 2003 . TUCS Gen. Publ. , 27. Turku : Turku Cent. Comput. Sci. , pp. 119 – 124 .
   Google Scholar
• Balázi , P. , Masáková , Z. , Pelantová , E. ( 2008 ). Characterization of substitution invariant 3iet words . Integers 8 .
   Google Scholar
• Berthé , V. , Ferenczi , S. , Zamboni , L. Q. ( 2005 ). Interactions between dynamics. Arithmetics and Combinatorics: The Good, the Bad, and the Ugly. Algebraic and Topological Dynamcis. Contemp. Math., Vol. 385. Providence, RI: Amer. Math. Soc., pp. 333–364 .
   Google Scholar
• Berstel , J. , Séébold , P. (2002). Sturmian words. In: Lothaire , M. , ed. Algebraic Combinatorics on Words, Encyclopedia of Mathematics and Its Applications , Vol. 90 . Cambridge : Cambridge University Press ( Chap. 2).
   Google Scholar
• Berstel , J. ( 1996 ). Recent results on Sturmian words . Developments in Language Theory II . River Edge , NJ : World Sci. Publ. , pp. 13 – 24 .
   Google Scholar
• Droubay , X. , Justin , J. , Pirillo , G. ( 2001 ). Episturmian words and some construction of de Luca and Rauzy . Theoret. Comp. Sci. 255 ( 1 ): 539 – 553 .
   Google Scholar
• Furstenberg , H. ( 1981 ). Poincaré reccurence and number theory . Bull. Amer. Math. Soc. 5 : 211 – 234 .
   Web of Science ®Google Scholar
• Ferenczi , S. , Zamboni , L. Q. Combinatorial structure of symmetric k-interval exchange transformations. http://iml.univ-mrs.fr/ ∼ferenczi/trav2.html
   Google Scholar
• Ferenczi , S. , Zamboni , L. ( 2008 ). Languages of k-interval exchange transformations . Bull. Lond. Math. Soc. 40 ( 4 ): 705 – 714 .
   Google Scholar
• Ferenczi , S. , Holton , C. , Zamboni , L. Q. ( 2003 ). Structure of three-interval exchange transformations II: a combinatorial description of the trajectories . J. Anal. Math. 89 : 239 – 276 .
   Web of Science ®Google Scholar
• Graham , R. L. ( 1973 ). Covering the Positive Integers by disjoints sets of the form {[nα + β]: n = 1, 2,…} . J. Combin. Theory Ser. A 15 : 354 – 358 .
   Google Scholar
• Hubert , P. ( 2000 ). Well balanced sequences . Theoret. Comput. Sci. 242 : 91 – 108 .
   Google Scholar
• de Luca , A. ( 1997 ). Sturmian words: structure, combinatorics and their arithmetics . Theoret. Comp. Sci. 183 : 45 – 82 .
   Google Scholar
• Lothaire , M. ( 1997 ). Combinatorics on Words . With a foreword by Roger Lyndon and a preface by Dominique Perrin. Corrected reprint of the 1983 original, with a new preface by Perrin. Cambridge Mathematical Library . Cambridge : Cambridge University Press , xviii+ 238 pp.
   Google Scholar
• Morse , M. , Hedlund , G. A. ( 1940 ). Symbolic dynamics II. Sturmian trajectories . Amer. J. Math. 62 : 1 – 42 .
   Google Scholar
• Rauzy , G. ( 1985 ). Mots infinis en arithmetique . In: Nivat , M. , Perrin , D. , eds. Automata on Infnite Words. Ecole de Printemps d'Informatique Theorique , Le Mont Dore, May 1984, Lecture Notes in Computer Science , Vol. 192 . Berlin : Springer-Verlag , pp. 165 – 171 .
   Google Scholar
• Rauzy , G. ( 1979 ). Exchanges d'intervalles et transformations induites . Acta Arith. 34 : 315 – 328 (French) .
   Google Scholar
• Rote , G. ( 1994 ). Sequences with subword complexity 2n. J. Number Theory 46:196–213 .
   Google Scholar
• Vuillon , L. ( 2003 ). Balanced words . Bull. Belg. Math. Soc. Simon Stevin 10 : 787 – 805 .
   Google Scholar
• Communicated by V. A. Artamonov.
   Google Scholar