Counting ternary square-free words quickly
arXiv:2012.03926
Abstract
An efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length over the alphabet is presented.
arXiv:2012.03926
An efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length over the alphabet is presented.