Minimal DFAs for Testing Divisibility
classification
💻 cs.CC
keywords
minimalansweringautomatonbase-bdeterministicdfasdivisibilitydivisible
read the original 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?"
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.