No. |
Title |
Author |
Year |
1 |
Decidability for Sturmian Words |
Hieronymi, Philipp et al. |
2022 |
2 |
Using Automata and a Decision Procedure to Prove Results in Pattern Matching (Invited Talk) |
Shallit, Jeffrey |
2022 |
3 |
Computational Fun with Sturdy and Flimsy Numbers |
Clokie, Trevor et al. |
2020 |
4 |
Existential Length Universality |
Gawrychowski, Paweł et al. |
2020 |
5 |
Optimal Regular Expressions for Permutations |
Molina Lovett, Antonio et al. |
2019 |
6 |
Lagrange's Theorem for Binary Squares |
Madhusudan, P. et al. |
2018 |
7 |
Rollercoasters and Caterpillars |
Biedl, Therese et al. |
2018 |
8 |
Sums of Palindromes: an Approach via Automata |
Rajasekaran, Aayush et al. |
2018 |
9 |
Fractional Coverings, Greedy Coverings, and Rectifier Networks |
Chistikov, Dmitry et al. |
2017 |
10 |
Periods and Borders of Random Words |
Holub, Štepán et al. |
2016 |
11 |
The Frobenius Problem in a Free Monoid |
Kao, Jui-Yi et al. |
2008 |