Uniformly balanced words with linear complexity and prescribed letter frequencies

DOI10.4204/EPTCS.63.8zbMath1331.68161arXiv1108.3620OpenAlexW3150175292MaRDI QIDQ2789512

Valérie Berthé, Sébastien Labbé

Publication date: 1 March 2016

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

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

zbMATH Keywords

discrepancydiscrete geometrymultidimensional continued fractionsletter frequencybalanced words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Continued fraction calculations (number-theoretic aspects) (11Y65)

Related Items (3)

On the structure of bispecial Sturmian words ⋮ Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm ⋮ Тригонометрические суммы над одномерными квазирешетками произвольной коразмерности

This page was built for publication: Uniformly balanced words with linear complexity and prescribed letter frequencies