1 citations · 2 across the 6 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2018
Additive Number Theory via Approximation by Regular Languages
Jason Bell, Thomas Finn Lidbetter, Jeffrey Shallit
We prove some new theorems in additive number theory, using novel techniques from automata theory and formal languages. As an example of our method, we prove that every natural num…
cs.FL2018
Counting Subwords and Regular Languages
Charles J. Colbourn, Ryan E. Dougherty, Thomas F. Lidbetter +1
Let and be words. We consider the languages whose words are those for which the numbers of occurrences of and , as subwords of , are the same (resp., the numb…