csci3255 HW 2-3 - CSCI3255: Math Foundations of CS Homework...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CSCI3255: Math Foundations of CS Homework 2, (2.3), page 1 September 2006 1. Use the construction of Theorem 2.2 to convert the nfa in the figure below to a dfa. Can you see a simpler answer more directly? The original machine requires an a in order to accept. Since the s can always get us back to the initial state, any number of additional a s can be accepted. Thats the dfa weve drawn. 2. Convert the nfa below into an equivalent dfa. 3. Convert the nfa below into an equivalent dfa. a q { q , q 1 , q 2 } q 1 { q , q 1 , q 2 } q 2 { q , q 1 , q 2 } 1 q { q 1 , q 2 } { q 1 , q 2 } q 1 { q , q 2 } { q 1 , q 2 } q 2 { q 1 , q 2 } 1 q { q , q 1 , q 2 } { q 1 , q 2 } q 1 { q , q 1 , q 2 } { q 1 , q 2 } q 2 { q 2 } { q 1 } q q 1 a q 2 a a Q 012 Q 0, 0,1 1 q q 1 q 2 1 1 1 0 1 Q Q 012 Q 12 0,1 0, 1 q q 1 q 2 1 Q 12 Q Q Q 02 0,1 1 0,1 CSCI3255: Math Foundations of CS Homework 2, (2.3), page 2 September 2006 5. Is it true that for any nfa M = ( Q , , , q , F ) that...
View Full Document

Page1 / 2

csci3255 HW 2-3 - CSCI3255: Math Foundations of CS Homework...

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

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