This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: (d) to obtain the initial state of add a new state and addtransitions too all states which were nal states in . The newly added state is the initial state of . (e) there is only one nal state, namely the state which was initial state in Why this works: A word is accepted in if there is a path from the initial state to the nal state. But given the construction this means that in there is a path from the initial state to one of the nal states. Therefore if if . The above argument works the other way around, therefore implies . This proves that 3. 3 points Design a nondeterministic nite automaton for the following language. has 101 as a substring 1 1 0,1 0,1...
View
Full
Document
This homework help was uploaded on 02/08/2008 for the course CSE 105 taught by Professor Paturi during the Summer '99 term at UCSD.
 Summer '99
 Paturi

Click to edit the document details