Minimal DFA for testing divisibility
作者：
Highlights：
•
摘要
We present and prove a theorem answering the question “how many states does a minimal deterministic finite automaton (DFA) recognizing the set of base-b numbers divisible by k have?”
论文关键词：
论文评审过程：Received 28 September 2003, Revised 21 January 2004, Available online 16 April 2004.
论文官网地址：https://doi.org/10.1016/j.jcss.2004.02.001
