On the permutation complexity of the Cantor-like sequences

DOI10.1016/J.TCS.2015.12.022zbMath1334.68175OpenAlexW2202596057MaRDI QIDQ906402

Xiao-Tao Lü, Jin Chen, Ying-Jun Guo, Zhi Xiong Wen

Publication date: 21 January 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.022

zbMATH Keywords

regular sequencefactor complexitypermutation complexityDFAOCantor-like sequence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata sequences (11B85)

Related Items (2)

On the \(k\)-abelian complexity of the Cantor sequence ⋮ Factor complexity and permutation complexity of the generalized Morse sequence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permutation complexity of the Thue-Morse word
• Automaticity of the Hankel determinants of difference sequences of the Thue-Morse sequence
• On the infinite permutation generated by the period doubling word
• On an infinite permutation similar to the Thue-Morse word
• The ring of \(k\)-regular sequences
• Complexity and special factors
• The ring of \(k\)-regular sequences. II.
• On periodicity and low complexity of infinite permutations
• On automatic infinite permutations
• On Subword Complexity of Morphic Sequences
• Automatic Sequences
• Reconnaissabilité des substitutions et complexité des suites automatiques
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES

This page was built for publication: On the permutation complexity of the Cantor-like sequences