Factor complexity and permutation complexity of the generalized Morse sequence
From MaRDI portal
Publication:2318232
DOI10.1016/j.amc.2018.02.019zbMath1427.68260OpenAlexW2791432762MaRDI QIDQ2318232
Publication date: 14 August 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.02.019
Cites Work
- Infinite permutations of lowest maximal pattern complexity
- Permutation complexity of the Thue-Morse word
- Substitutions in dynamics, arithmetics and combinatorics
- On the permutation complexity of the Cantor-like sequences
- On the infinite permutation generated by the period doubling word
- On an infinite permutation similar to the Thue-Morse word
- On permutations generated by infinite binary words
- On periodicity and low complexity of infinite permutations
- Unnamed Item