On permutation complexity of fixed points of uniform binary morphisms

MaRDI QIDQ2928585zbMATH OpenFDO

Authors Alexandr Valyuzhenich

Publication date 10 November 2014

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2306/0.html

zbMATH Keywords

factor complexityinfinite permutationmorphism

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Combinatorics on words (68R15)

Cited in

(5)

• Morphic words and equidistributed sequences
• Permutation complexity of the fixed points of some uniform binary morphisms
• Canonical representatives of morphic permutations
• 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: On permutation complexity of fixed points of uniform binary morphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2928585)