arXiv
Open Access
2020
Counting ternary square-free words quickly
Vladislav Makarov
Abstrak
An efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length $n$ over the alphabet $\{a, b, c\}$ is presented.
Penulis (1)
V
Vladislav Makarov
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2020
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓