Permutation complexity of the fixed points of some uniform binary morphisms

Valyuzhenich, Alexander

Permutation complexity of the fixed points of some uniform binary morphisms

Alexander Valyuzhenich
(Novosibirsk State University)

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

In Petr Ambrož, Štěpán Holub and Zuzana Masáková: Proceedings 8th International Conference Words 2011 (WORDS 2011), Prague, Czech Republic, 12-16th September 2011, Electronic Proceedings in Theoretical Computer Science 63, pp. 257–264.
Published: 17th August 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.63.32

bibtex

PDF

References in reconstructed bibtex, XML and HTML format (approximated).

Comments and questions to:

eptcs@eptcs.org

For website issues:

webmaster@eptcs.org