References

1. D. G. Fon-Der-Flaass & A. E. Frid (2007): On periodicity and low complexity of infinite permutations. European J. Combin. 28(8), pp. 2106–2114, doi:10.1016/j.ejc.2007.04.017.
2. A.E. Frid (2000): On Combinatorial Properties of fixed points of morphisms. Ph.D. thesis, Novosibirsk.
3. M. A. Makarov (2006): On permutations generated by infinite binary words. Sib. Èlektron. Mat. Izv. 3, pp. 304–311 (electronic).
4. M. A. Makarov (2009): On permutations generated by Sturmian words. Sibirsk. Mat. Zh. 50(4), pp. 850–857, doi:10.1007/s11202-009-0076-6.
5. S Widmer (2011): Permutation complexity of the Thue-Morse word. Advances in Applied Mathematics 47(2), pp. 309–329, doi:10.1016/j.aam.2010.08.002.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org