Papers
Topics
Authors
Recent
Search
2000 character limit reached

Permutation complexity of the fixed points of some uniform binary morphisms

Published 18 Aug 2011 in cs.DM | (1108.3641v1)

Abstract: 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.

Citations (3)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Alexander Valyuzhenich 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up