1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.FL2017★ 1 cited
Sums of Palindromes: an Approach via Automata
Aayush Rajasekaran, Jeffrey Shallit, Tim Smith
Recently, Cilleruelo, Luca, & Baxter proved, for all bases b >= 5, that every natural number is the sum of at most 3 natural numbers whose base-b representation is a palindrome. Ho…
cs.FL2017
Undecidability and Finite Automata
Jörg Endrullis, Jeffrey Shallit, Tim Smith
Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove thr…
cs.FL2016
Prediction of Infinite Words with Automata
Tim Smith
In the classic problem of sequence prediction, a predictor receives a sequence of values from an emitter and tries to guess the next value before it appears. The predictor masters…