On Pansiot Words Avoiding 3-Repetitions

DOI10.4204/EPTCS.63.19zbMath1331.68167arXiv1108.3630MaRDI QIDQ2789523

Irina A. Gorbunova, Arseny M. Shur

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.3630

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

Growth properties of power-free languages ⋮ The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$

This page was built for publication: On Pansiot Words Avoiding 3-Repetitions