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: ECS 120: Theory of Computation Handout Quiz #1S UC Davis — Phil Rogaway April 18, 2010 Quiz 1 Solutions Questions 1–4 were graded out of 10 points; questions 5–13 were graded out of 25 points total; question 14 was graded out of 20 points. So the total possible was 85 points. 1. Complete the following, being mathematically precise and following the conventions of your text: An NFA is a fivetuple M = ( Q, Σ , δ, q , F ) where: Q is a finite set, Σ is an alphabet, q ∈ Q , F ⊆ Q , and δ is a function having domain and range δ : Q × (Σ ∪ { ε } ) → P ( Q ) 2. Draw a DFA for the language: L = { x ∈ { a, b, c } ∗ : x contains at least one a and at least one b } Make your DFA use a minimal possible number of states. Don’t forget the c ’s. a b b a a, c a, b, c b, c c 3. List the first five strings, according to the lexicographic ordering, 1 of the language L = { x ∈ { a, b, c } ∗ : x contains at least one a and at least one b } ....
View
Full
Document
This note was uploaded on 04/19/2010 for the course ECS 120 taught by Professor Filkov during the Spring '07 term at UC Davis.
 Spring '07
 Filkov

Click to edit the document details