Permutation complexity of the fixed points of some uniform binary morphisms

Details Permutation complexity of the fixed points of some uniform binary morphisms Permutation complexity of the fixed points of some uniform binary morphisms

2011-08-18

arxiv.org/abs/1108.3641v1

EPTCS 63, 2011, pp. 257-264

Computer Science

Discrete Mathematics

In Proceedings WORDS 2011, arXiv:1108.3412

Scientific paper

10.4204/EPTCS.63.32

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.

Affiliated with

Also associated with

No associations

Rating

Permutation complexity of the fixed points of some uniform binary morphisms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Permutation complexity of the fixed points of some uniform binary morphisms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Permutation complexity of the fixed points of some uniform binary morphisms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180659