Minimal DFA for testing divisibility
Copyright policy )Minimal DFA 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?"
LaTeX, 7 pages (corrected typo in new version)
FOS: Computer and information sciences, deterministic finite automaton, Computer Networks and Communications, Applied Mathematics, F.1.1; F.4.3, Formal languages and automata, Computational Complexity (cs.CC), Theoretical Computer Science, Computer Science - Computational Complexity, Computational Theory and Mathematics, F.4.3, F.1.1
FOS: Computer and information sciences, deterministic finite automaton, Computer Networks and Communications, Applied Mathematics, F.1.1; F.4.3, Formal languages and automata, Computational Complexity (cs.CC), Theoretical Computer Science, Computer Science - Computational Complexity, Computational Theory and Mathematics, F.4.3, F.1.1
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).13 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!