TL;DR
This paper introduces a faster algorithm for counting square-free words of length n over a three-letter alphabet, improving upon exhaustive enumeration methods.
Contribution
It presents a novel, efficient algorithm for counting ternary square-free words, significantly reducing computational complexity.
Findings
The algorithm outperforms exhaustive enumeration in speed.
It accurately counts square-free words for larger n.
The method can be applied to related combinatorial problems.
Abstract
An efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length over the alphabet is presented.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.