EECS 303 Mailing List


From: James Swaine <jamesswaine2010_at_avoiding.spam>
Date: Tue Nov 25 2008 - 03:59:46 EST

No. 5 specifies a sequence recognizer that will accept (among other things)
either sequences ending in 11 or sequences that match the string 110.
obviously if we have an input string of 11, we're already in an accepting
state. in the NFA diagram, would it be best to design something like:

--->A----1---->B----1---->C----Lambda---->D (accepting)
                                        ---------0--------->E (accepting)


--->A---1--->B---1--->C---->D (accepting) ----0----->E (accepting)

i apologize for my lame graphic, hopefully this makes sense.

Received on Tue Nov 25 02:59:46 2008

This archive was generated by hypermail 2.1.8 : Tue Jan 06 2009 - 18:55:01 EST