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

Info iconThis preview shows pages 1–3. 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.2), page 1 September 2006 Chapter 2, Section 2. Problems 2-12 2. Find a dfa that accepts the language defined by the nfa: 3. Find a dfa that accepts the complement of the language accepted by the previous dfa. Just change the accepting states of the dfa above into non-accepting and vice-versa. Note that this is only assured of working when the original machine is a dfa. 4. For the nfa below, find *( q , 1011) and *( q 1 , 01) *( q , 1011) = { q 2 } *( q 1 , 01) = { q 1 } 5. For the nfa below, find *( q , a ) and *( q 1 , ) *( q , a ) = { q , q 1 , q 2 } *( q 1 , ) = { q , q 1 , q 2 } a q { q 1 , q 4 } q 1 { q 2 } q 2 { q 3 } q 3 q 4 { q 5 } q 5 { q 4 } a a a a a a q q 1 q 2 q 3 q 4 q 5 Q Q 14 Q 25 Q 34 Q 5 Q 4 a a a a a a q q 1 q 2 1 0,1 a q q 1 q 2 CSCI3255: Math Foundations of CS Homework 2, (2.2), page 2 September 2006 6. For the nfa in problem 4, find *( q , 1010) and *( q 1 , 00) *( q...
View Full Document

This note was uploaded on 05/07/2010 for the course COMPUTER S 138 taught by Professor Icamarra during the Spring '10 term at UCLA.

Page1 / 3

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

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