Minimal DFAs for Testing Divisibility

Details Minimal DFAs for Testing Divisibility Minimal DFAs for Testing Divisibility

2003-09-29

arxiv.org/abs/cs/0309052v1

J. Comput. System Sci. 69 (2004), no. 2, 235--243

Computer Science

Computational Complexity

LaTeX, 7 pages (corrected typo in new version)

Scientific paper

10.1016/j.jcss.2004.02.001

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

Affiliated with

Also associated with

No associations

Rating

Minimal DFAs for Testing Divisibility does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimal DFAs for Testing Divisibility, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimal DFAs for Testing Divisibility will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-370746