NewEvery arXiv paper, its researchers & institutions — mapped.
paper

Minimal DFAs for Testing Divisibility

arXiv:cs/0309052 · doi:10.1016/j.jcss.2004.02.001

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?"

LaTeX, 7 pages (corrected typo in new version)