Search the web
Sign In
New User? Sign Up
comp-sci-theory · Computer Science Theory
  • Members Only
  • Post
  • Files
  • Photos
  • Database
  • Polls
  • Members
  • Promote
  • Groups Labs (Beta)
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Message search is now enhanced, find messages faster. Take it for a spin.

Best of Y! Groups

   Check them out and nominate your group.
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.

Messages

   Messages Help
Message #
Search:
Advanced
Sipser. Introduction to Computation Theory. Problem: 1.37   Message List  
Reply | Forward Message #2707 of 2737 |
RE: [comp-sci-theory] Sipser. Introduction to Computation Theory. Problem: 1.37

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 Christoff
Moderator
 
-----Original Message-----
From: comp-sci-theory@yahoogroups.com [mailto:comp-sci-theory@yahoogroups.com]On Behalf Of manzur1986
Sent: October 29, 2007 4:59 PM
To: comp-sci-theory@yahoogroups.com
Subject: [comp-sci-theory] Sipser. Introduction to Computation Theory. Problem: 1.37

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


______________________________________________________________________
This email has been scanned by the CAMH Email Security System.
______________________________________________________________________

______________________________________________________________________
This email has been scanned by the CAMH Email Security System.
______________________________________________________________________
Mon Oct 29, 2007 9:29 pm

Show Message Option
crankyho2000
Offline Offline
Send Email Send Email

Forward 		Message #2707 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
Offline Send Email 		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
Offline Send Email 		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
Offline Send Email 		Oct 31, 2007
3:54 am
< Prev Topic  |  Next Topic >
Message #
Search:
Advanced
Copyright © 2009 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines - Help