Permutation complexity of the fixed points of some uniform binary morphisms
From MaRDI portal
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.
Recommendations
- On permutation complexity of fixed points of uniform binary morphisms
- On permutation complexity of fixed points of some nonuniform binary morphisms
- The subword complexity of fixed points of binary uniform morphisms
- scientific article; zbMATH DE number 2031117
- scientific article; zbMATH DE number 4053621
- On the permutation complexity of the Cantor-like sequences
- On the complexity of theories of permutations
- The parameterized complexity of fixpoint free elements and bases in permutation groups
- scientific article; zbMATH DE number 67246
- Fixed points and excedances in restricted permutations
Cited in
(7)- On the infinite permutation generated by the period doubling word
- Factor complexity and permutation complexity of the generalized Morse sequence
- Simple permutations: Decidability and unavoidable substructures
- Permutation complexity of images of Sturmian words by marked morphisms
- Factor complexity and a permutation similar to the 3-fold Morse sequence
- On k-repetition freeness of length uniform morphisms over a binary alphabet
- On the permutation complexity of the Cantor-like sequences
This page was built for publication: Permutation complexity of the fixed points of some uniform binary morphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789536)
