Showing 2020Show all
2 papers · 1 filter
cs.FL2020
Counting ternary square-free words quickly
Vladislav Makarov
An efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length over the alphabet is presented.
cs.GT2020
Playing odds and evens with finite automata
Vladislav Makarov
This paper is concerned with asymptotic behaviour of a repeated game of "odds and evens", with strategies of both players represented by finite automata. It is proved that, for eve…