Minimal DFAs for Testing Divisibility
Boris Alexeev
cs.CCarXiv:cs/0309052
Abstract
We present and prove a theorem answering the question "how many states does a minimal deterministic finite automaton (DFA) that recognizes the set of base-b numbers divisible by k have?"
Create a lesson
Related papers
How far is Kolmogorov-Loveland randomness from Martin-Löf randomness?
Tomislav Petrović
The Complexity of Finding Additional Solutions
Saman Farhat
On the Hardness of 4-to-1 Games with Perfect Completeness
Yumou Fei, Dor Minzer, Shuo Wang
Near-Inverse-Linear Barriers for Explicit Affine Witness Isolation
Sebastian Ben Daniel
∃ R ⊂eq CH
Alex Meiburg
Primal/Dual Method for the Grothendieck Constant
Steven Heilman, Chris Jones, Giulio Malavolta