HW2Soln

HW2Soln - CSCI 2670 Fall 2005 HW 1 September 6, 2005 1.7b...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
CSCI 2670 Fall 2005 HW 1 September 6, 2005 1.7b 1.8a 1.10a 1.15 The construction described in this problem is similar to the construction in the proof of Theorem 1.49. The difference is that the construction in the problem uses the original start state and makes it into an accept state. The proof of Theorem 1.49 adds a new start state which is an accept state and there is an ε jump from the new start state to the original start state. Thus, this problem is designed to illustrate that it is necessary to introduce a new start state rather than just changing the original start state to an accept state. The reason for this is that there are some DFA’s in which (i) the start state is not an accept state, and (ii) it is possible to leave the start state and come back to it. If you
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
change the start state into an accept state under these conditions, you will accept all strings that will leave the accept state and finish at the accept state – these strings should not be in A 1 * . Below is an example: This DFA accepts all strings of alternating 0’s and 1’s that begin and end with a 0. Below are the Kleene star construction described in the proof of Theorem 1.49 and the
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/07/2011 for the course CS 501 taught by Professor Sm during the Spring '11 term at Indiana.

Page1 / 5

HW2Soln - CSCI 2670 Fall 2005 HW 1 September 6, 2005 1.7b...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online