Notices
Results 1 to 1 of 1

Thread: Need Help with Automata Theory work.

  1. #1 Need Help with Automata Theory work. 
    New Member
    Join Date
    Mar 2012
    Posts
    2
    First of all, sorry if this doesn't belong on this part of the forum.

    I've been having lots of trouble understanding the material for Automata Theory. How do I go about solving these problems?

    *The following question(s) comes from the Introduction to the Theory of Computation by Michael Sipser, unless otherwise noted.

    1.13. Let F be the language of all strings over {0,1} that do not contain a pair of 1s that are separated by an odd number of symbols. Give the state diagram of a DFA with 5 states that recognizes F. (You may find it helpful first to find a 4-state NFA for the complement of F).


    Reply With Quote  
     

  2.  
     

Similar Threads

  1. Replies: 5
    Last Post: April 17th, 2011, 02:45 PM
  2. Ambiguous and definite automata to deterministic automata
    By tonguim in forum Computer Science
    Replies: 0
    Last Post: February 14th, 2011, 04:00 PM
  3. automata builder
    By akileza in forum Computer Science
    Replies: 1
    Last Post: October 7th, 2010, 01:40 PM
  4. Help in Theory of Automata
    By adi.shoukat in forum Mathematics
    Replies: 0
    Last Post: December 9th, 2009, 06:30 AM
  5. Automata
    By analynsarte in forum Computer Science
    Replies: 5
    Last Post: October 7th, 2009, 06:41 PM
Bookmarks
Bookmarks
Posting Permissions
  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •