On factor complexity of morphic sequences

MaRDI QIDQ4966550zbMATH OpenFDO

Authors Rostislav Devyatov

Publication date 26 June 2019

Full work available at URL http://www.mathjournals.org/mmj/2018-018-002/2018-018-002-003.html

zbMATH Keywords

factor complexitymorphic sequencepure morphic sequence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Free semigroups, generators and relations, word problems (20M05) Combinatorics on words (68R15)

Recommendations

• On the asymptotic abelian complexity of morphic words
• On the asymptotic abelian complexity of morphic words
• ON UNIFORMLY RECURRENT MORPHIC SEQUENCES
• On the abelian complexity of generalized Thue-Morse sequences
• Computing abelian complexity of binary uniform morphic words

Cited in

(8)

• Logarithmic frequency in morphic sequences
• Momentopes, the complexity of vector partitioning, and Davenport-Schinzel sequences
• Factor complexity and permutation complexity of the generalized Morse sequence
• Complexity of Hartman sequences
• Decidability of uniform recurrence of morphic sequences
• scientific article; zbMATH DE number 3864526 (Why is no real title available?)
• On the minimal components of substitution subshifts
• The reflection complexity of sequences over finite alphabets

This page was built for publication: On factor complexity of morphic sequences

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