Counting ternary square-free words quickly

DOI10.1007/978-3-030-85088-3_12OpenAlexW3199903545MaRDI QIDQ2140467

Vladislav Makarov

Publication date: 20 May 2022

Full work available at URL: https://arxiv.org/abs/2012.03926

zbMATH Keywords

dynamic programmingsquare-free wordsinclusion-exclusionAho-Corasick automaton

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Uses Software

• OEIS
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Growth properties of power-free languages
• On ternary square-free circular words
• Uniformly growing k-th power-free homomorphisms
• Efficient string matching

This page was built for publication: Counting ternary square-free words quickly