Minimal DFAs for Testing Divisibility
<|reference_start|>Minimal DFAs for Testing Divisibility: 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?"<|reference_end|>
@article{alexeev2003minimal,
    title={Minimal DFAs for Testing Divisibility},
    author={Boris Alexeev},
    journal={J. Comput. System Sci. 69 (2004), no. 2, 235--243},
    year={2003},
    doi={10.1016/j.jcss.2004.02.001},
    archivePrefix={arXiv},
    eprint={cs/0309052},
    primaryClass={cs.CC}
}