This preview shows pages 1–2. Sign up to view the full content.
CS 6353
Compiler Construction, Homework #1
1.
Write regular expressions for the following informally described languages:
a.
All strings of 0’s and 1’s with the subsequence 011.
b.
All strings of 0’s and 1’s with the substring 00*1.
2.
Consider
Σ
= {a, b}. Answer the following DFA related questions. When constructing DFA, there is
no need to show your construction steps, but you need to informally state how you get the DFAs.
a.
Construct a DFA that accepts (ab)* except for aabb.
b.
Construct a DFA that accepts (ab)* except for b*a*.
c.
Based on the techniques you use in (a) and (b), can you come up with a DFA construction
algorithm for the “except for” type of languages?
3.
Consider the regular expression aac*  b(ab)c* defined on
Σ
= {a, b, c}.
a.
Construct the NFA for the regular expression. You can directly draw the NFA without going
through the REtoNFA steps.
b.
Convert the NFA to DFA. You need to show the conversion steps.
c.
Minimize the DFA. You need to show the minimization steps.
4.
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.
This note was uploaded on 01/25/2012 for the course CS 6413 taught by Professor Ye during the Spring '07 term at University of Texas at Dallas, Richardson.
 Spring '07
 ye

Click to edit the document details