?. Let-?, Then there exists an occurrence (u, m) of u such that ?(u, m) = ? and (u, m) is an occurrence

?. Let-?, l 2 + 1}. Then there exists an occurrence (u, m) of u such that ?(u, m) = ? and (u, m) is an occurrence, p.5

?. Since-?, Since ? is a marked morphism, ?(1) starts with 1. Let ?(0) = 0 k 1... for k > 1 or ?(0) = 0 l . If ?(0) = 0 k 1..., then 0u1 is a subword of ?(0) and 0u0 is a prefix of ?(0) for empty word u. It contradicts with Property 1 in the definition of Q l . If ?(0) = 0 l , then 0u is a suffix of ?(0) and 0u0 is a prefix of ?(0) for empty word u. It contradicts with Property 1 in the definition of Q l . Thus ?(0) starts with 01. Analogously one can obtain that ?(1) starts with 10, But we have ?(01) = ?(0)?(1) = 01...10

=. Let-|u|, Since ? ? H u , there exists some occurrence (u, m 1 ) of u such that ?(u, m 1 ) = ?. Let (u m1 , m References S. V. Avgustinovich. The number of distinct subwords of fixed length in the morse-hedlund sequence, Sibirsk. zhurnal issledovaniya operatsii, vol.1, issue.2, pp.3-7, 1994.

S. V. Avgustinovich, A. Frid, T. Kamae, and P. Salimov, Infinite permutations of lowest maximal pattern complexity, Theoretical Computer Science, vol.412, issue.27, pp.2911-2921, 2011.
DOI : 10.1016/j.tcs.2010.12.062

S. Brlek, Enumeration of factors in the Thue-Morse word, Discrete Applied Mathematics, vol.24, issue.1-3, pp.83-96, 1989.
DOI : 10.1016/0166-218X(92)90274-E

J. Cassaigne, An algorithm to test if a given circular hd0l-language avoids a pattern, IFIP World Computer Congress'94, 1994.

J. Cassaigne, Complexité et facteurs spéciaux, Bull. Belg. Math. Soc, vol.4, pp.67-88, 1997.

J. Cassaigne and F. Nicolas, Factor complexity in combinatorics, Combinatorics, Automata and Number Theory, 2010.

D. Fon-der-flaass and A. Frid, On periodicity and low complexity of infinite permutations, European Journal of Combinatorics, vol.28, issue.8, pp.2106-2114, 2007.
DOI : 10.1016/j.ejc.2007.04.017

A. E. Frid, On the subword complexity of infinite words generated by morphisms. Diskr. analiz i issl. operacii, pp.53-59, 1997.

A. E. Frid, On uniform DOL words, STACS'98, pp.544-554, 1998.
DOI : 10.1007/BFb0028589

A. E. Frid, On Combinatorial Properties of fixed points of morphisms, 2000.

A. Luca and S. Varricchio, Some combinatorial properties of the Thue???Morse sequence and a problem in semigroups, Theoretical Computer Science, vol.63, issue.3, pp.333-348, 1989.
DOI : 10.1016/0304-3975(89)90013-3

M. A. Makarov, On permutations generated by infinite binary words, Sib. Elektron. Mat. Izv, vol.3, pp.304-311, 2006.

M. A. Makarov, On the permutations generated by Sturmian words, Siberian Mathematical Journal, vol.380, issue.3, pp.674-680, 2009.
DOI : 10.1007/s11202-009-0076-6

A. Valyuzhenich, Permutation complexity of the fixed points of some uniform binary morphisms, Proceedings of WORDS 2011, pp.257-264, 2011.
DOI : 10.4204/EPTCS.63.32

S. Widmer, Permutation complexity of the Thue???Morse word, Advances in Applied Mathematics, vol.47, issue.2, pp.309-329, 2011.
DOI : 10.1016/j.aam.2010.08.002