Factor complexity and permutation complexity of the generalized Morse sequence
From MaRDI portal
Publication:2318232
DOI10.1016/J.AMC.2018.02.019zbMATH Open1427.68260OpenAlexW2791432762WikidataQ130194072 ScholiaQ130194072MaRDI QIDQ2318232FDOQ2318232
Authors: Min Niu, Qiuxia Liu 
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
Recommendations
- On factor complexity of morphic sequences
- Factor complexity and a permutation similar to the 3-fold Morse sequence
- On the abelian complexity of generalized Thue-Morse sequences
- Permutation complexity of the Thue-Morse word
- Permutation polynomials, de Bruijn sequences, and linear complexity
- On the permutation complexity of the Cantor-like sequences
- On Subword Complexity of Morphic Sequences
- scientific article; zbMATH DE number 1195740
- Permutation complexity of the fixed points of some uniform binary morphisms
Cites Work
- Substitutions in dynamics, arithmetics and combinatorics
- On permutations generated by infinite binary words
- On the permutations generated by Sturmian words
- On periodicity and low complexity of infinite permutations
- Infinite permutations of lowest maximal pattern complexity
- On the infinite permutation generated by the period doubling word
- On an infinite permutation similar to the Thue-Morse word
- Permutation complexity of the Thue-Morse word
- On the permutation complexity of the Cantor-like sequences
Cited In (2)
This page was built for publication: Factor complexity and permutation complexity of the generalized Morse sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2318232)
