Abelian maximal pattern complexity of words

DOI10.1017/etds.2013.51zbMath1351.37052arXiv1301.5113OpenAlexW2032386063MaRDI QIDQ5175078

Luca Q. Zamboni, Steven Widmer, Teturo Kamae

Publication date: 19 February 2015

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

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

zbMATH Keywords

binary wordsabelian equivalencecomplexity of infinite words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Symbolic dynamics (37B10)

Related Items (1)

Abelian combinatorics on words: a survey

Cites Work

• Elemental methods in ergodic Ramsey theory
• Maximal pattern complexity of words over \(\ell\) letters
• Abelian complexity of minimal subshifts
• Uniform sets and super-stationary sets over general alphabets
• Sequences with minimal block growth
• Symbolic Dynamics II. Sturmian Trajectories

This page was built for publication: Abelian maximal pattern complexity of words