Minimal DFAs for Testing Divisibility

Simple item page
dc.creatorAlexeev, Boris
dc.date2003-09-29
dc.date.accessioned2026-07-07T08:05:50Z
dc.date.available2026-07-07T08:05:50Z
dc.descriptionWe 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?"
dc.descriptionLaTeX, 7 pages (corrected typo in new version)
dc.identifierhttps://arxiv.org/abs/cs/0309052
dc.identifierhttp://arxiv.org/abs/cs/0309052
dc.identifierJ. Comput. System Sci. 69 (2004), no. 2, 235--243
dc.identifierdoi:10.1016/j.jcss.2004.02.001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/130404
dc.subjectComputational Complexity
dc.subjectF.1.1; F.4.3
dc.titleMinimal DFAs for Testing Divisibility
dc.typetext

Files

Collections

arXiv