{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

mid1sample

# mid1sample - 1 Name Solutions Solutions Solutions Solutions...

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
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 Name: _________ _________ _________ _________ Solutions Solutions Solutions Solutions ______________ ______________ ______________ __________________ ____ ____ ____ C SC/MATH 473 Midterm 1 TIME = 75 min Instructions: Write your name in the space provided. Do ALL of the Short Answer problems (1-5), and do TWO of the Long Problems. W r i t e a l l a n s w e r s o n t h i s e x a m p a p e r . When finished, place the exam in the labeled envelope provided, l e a v e t h e e n v e l o p e u n s e a l e d , and turn it in. Short Answer (Do all 1-5) Long Problems (Do any 2) Problem 1 2 3 4 5 6 7 8 Σ Points 12 12 12 12 12 20 20 20 100 Short Answer 1. True or False? see comments after # -- no reasons required on exam a. __F___ (1+0)*= (1*0)* # 11 not in (1*0)* b. __F___ If L is a regular language and S ⊆ L, then S is regular. #{ } n n a b a b * * ⊆ c. __T___ { | , { , }} R L xyx x y a b * = ∈ is regular. # { , }. Set x= L a b ε * = d. __T___ If N is an NFA, then ( , ) ( , ) ( , ) ( , ) Ｔ Ｔ N N q xy p y q x p ε * * ⇔ # by def. of N * Ｔ e. __F___ { } L L ε * + =- # { }. { } { } a a ε ε ε * + ∈ ∉- f. __F___ { | } R R L L ww w L ⋅ = ∈ # { , } { , , , } #{ | } { , } R R L a b L L aa ab ba bb w w w L aa bb = ⇒ ⋅ = ⋅ ∈ = 2. Designing DFA . Construct a DFA that recognizes the following...
View Full Document

• Spring '10
• Roberts
• Transitive relation, Formal language, Regular expression, Regular language, Nondeterministic finite state machine

{[ snackBarMessage ]}

### Page1 / 4

mid1sample - 1 Name Solutions Solutions Solutions Solutions...

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

View Full Document
Ask a homework question - tutors are online