--- In comp-sci-theory@yahoogroups.com, "manzur1986" <manzur1986@...>
wrote:
>
> Let C[n] = {x | x is a binary number that is multiple of n}. Show
> that for each n >= 1, the language C[n] is regular.
> Thanks in advance
>
Say n=7. Your DFA has 7 states q_0, ..., q_7. It is in q_k when the
part of the input that has been read is k mod 7. Just need to figure
out the state transitions when one more bit is read.
Best,
Ching-Lueh
Yahoo! Groups TipsDid you know...Want to share photos of your group with the world? Add a group photo to Flickr. |
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
|
|||||||||||||||||||||||||||
Offline 
Send Email