comp-sci-theory : Message: Sipser. Introduction to Computation Theory. Problem: 1.37

comp-sci-theory · Computer Science Theory

Hear how Yahoo! Groups has changed the lives of others. Take me there.

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.

Sipser. Introduction to Computation Theory. Problem: 1.37

Message #2706 of 2737 |

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

Mon Oct 29, 2007 8:58 pm

"manzur1986" <manzur1986@...>

Offline

Message #2706 of 2737 |

Expand Messages	Author	Sort by Date
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...	manzur1986	Oct 29, 2007 8:58 pm
This is exactly the type of thing that is not wanted on this group. This is not a homework answer database. Continue like this and you will be banned. Mike...	Michael Christoff crankyho2000	Oct 29, 2007 9:29 pm
... 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...	ptt_hatred	Oct 31, 2007 3:54 am