Pages that link to "Item:Q2461768"
From MaRDI portal
The following pages link to On periodicity and low complexity of infinite permutations (Q2461768):
Displaying 22 items.
- On a generalization of abelian equivalence and complexity of infinite words (Q388738) (← links)
- Ordering sequences by permutation transducers (Q505039) (← links)
- Characterization of the allowed patterns of signed shifts (Q516799) (← links)
- Infinite permutations of lowest maximal pattern complexity (Q544872) (← links)
- Permutation complexity of the Thue-Morse word (Q550264) (← links)
- Antimonotone permutations (Q890929) (← links)
- On the permutation complexity of the Cantor-like sequences (Q906402) (← links)
- On the infinite permutation generated by the period doubling word (Q1041212) (← links)
- On an infinite permutation similar to the Thue-Morse word (Q1045205) (← links)
- Morphic words and equidistributed sequences (Q2283040) (← links)
- Factor complexity and permutation complexity of the generalized Morse sequence (Q2318232) (← links)
- A viewpoint for permutations with a low density of patterns (Q2345771) (← links)
- On permutations generated by infinite binary words (Q2371259) (← links)
- Minimal complexity of equidistributed infinite permutations (Q2400969) (← links)
- Infinite permutations vs. infinite words (Q2789508) (← links)
- Permutation complexity related to the letter doubling map (Q2789537) (← links)
- Permutation complexity and the letter doubling map (Q2841975) (← links)
- On automatic infinite permutations (Q2911428) (← links)
- Canonical Representatives of Morphic Permutations (Q3449357) (← links)
- Central sets generated by uniformly recurrent words (Q5262240) (← links)
- On the permutations generated by Sturmian words (Q5391598) (← links)
- (Q5887816) (← links)
