I'm having a really tough time getting from NFA to DFA in problem 1.13. Has anyone who is still awake been able to solve this problem?


Anyone who can help who isn't in the class, the problem asks that we design a 5 state DFA that is the language with no odd number of characters between 2 1s. It first asks us to do a 4 state NFA which is the complement, and then turn that into the 5 state DFA. Any thoughts?


Right now, I have:


qo -(1)-> q1 -(1)-> odd
|
(0)
|
^
even

1,0 once in even odd moves one back and forth. 1, 0 stays in odd, 1 stays in even. Thanks

2/7/2006 12:58:25 AM

office hours - in the past the TAs for this course are very good - although when i had it the TA would sit in the back of the class with outlook open and send his imap password over wireless unencrypted - i always wondered what would cause him to think it that was a good idea

2/7/2006 10:55:39 AM

yeah, TA had a mix up, and I got the rest of the homework so I figured I'll wait til the last day. lesson learned.

2/7/2006 8:25:54 PM

abwood - xxcxfzm2

2/8/2006 10:58:31 PM