ALGO_SP08_Q1

ALGO_SP08_Q1 - NAME FLORIDA MAD 3512 Quiz#1 Sprinq INTIL...

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

NAME: FLORIDA INTIL UNIV. MAD 3512: Quiz #1 - Sprinq 08 TIME: 30 min. Just wri te "TRUE" or "FALSE". (10) l(a) For any languages A and B, we always have (B.A)* =(B*.A*). (b) If a regular expression E contains ~*, then L(E) ~W. (c) If a CFG, G ~ W has no useless productions then L (G) ~ W. (d) Any ambiguous CFG is equivalent to an unambiguous CFG. (e) If a DFA M has no inaccesible states and M has at least one accepting state, then L (M) ~ w. Just write down the correct answer. (18) 2(a) Find a regular expression E for the set of all strings in {a,b}* which contains at least three biS. Ans: E = (b) If G = {S~bSAA, S~A, A~a, A->A}, then L (G) = (c) If M is the NFA below, then . b (}q A)r~ c (d) Find a RLG G for £* .b* .£.Q L(M) = Ans: G = (e) Find a DFA M wi th L (M) = Q* + (~* .Q) Ans: M = (12) 3 (a) (b) (c) (d) Use the back of this paper for question #3. A regular expression over {0,1} is a string on which alphabet? Define

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.

{[ snackBarMessage ]}

Page1 / 2

ALGO_SP08_Q1 - NAME FLORIDA MAD 3512 Quiz#1 Sprinq INTIL...

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

View Full Document
Ask a homework question - tutors are online