Binomial complexities and Parikh-collinear morphisms

DOI10.1007/978-3-031-05578-2_20OpenAlexW4285170867MaRDI QIDQ2164005

Manon Stipulanti, Michel Rigo, Markus A. Whiteland

Publication date: 11 August 2022

Full work available at URL: https://arxiv.org/abs/2201.04603

zbMATH Keywords

morphic wordsbinomial complexitypowers of Thue-Morse morphism

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Abelian combinatorics on words: a survey ⋮ On extended boundary sequences of morphic and Sturmian words ⋮ Automaticity and Parikh-Collinear Morphisms ⋮ On the 2-binomial complexity of the generalized Thue-Morse words ⋮ Characterizations of families of morphisms and words via binomial complexities

Cites Work

• Unnamed Item
• Unnamed Item
• Introducing privileged words: privileged complexity of Sturmian words
• On a generalization of abelian equivalence and complexity of infinite words
• Another generalization of abelian equivalence: binomial complexity of infinite words
• Relations on words
• Cyclic complexity of words
• Reconstruction from subsequences.
• Equations over the \(k\)-binomial monoids
• AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
• Automatic Sequences
• Coded Trace Reconstruction
• Constructions of strictly ergodic systems
• Computing the \(k\)-binomial complexity of the Thue-Morse word
• Templates for the \(k\)-binomial complexity of the Tribonacci word

This page was built for publication: Binomial complexities and Parikh-collinear morphisms