Counting ternary square-free words quickly
Formal Languages and Automata Theory
2021-05-11 v2 Combinatorics
Abstract
An efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length over the alphabet is presented.
Cite
@article{arxiv.2012.03926,
title = {Counting ternary square-free words quickly},
author = {Vladislav Makarov},
journal= {arXiv preprint arXiv:2012.03926},
year = {2021}
}