CSE 30151 Theory of Computing: Homework 3
NFAs and Regex
Version 2: Sept. 8, 2017
Instructions
•Unless otherwise specified, all problems from “the book” are from Version 3. When a problem in
the International Edition is different from Version 3, the problem will be listed as V3:x.yy/IE:x.zz,
where x.zz is the equivalent number. When Version 2 has a different number, it will be listed as
V3:x.yy/V2:x.zz. If either IE or V2 does not have a matching number, the problem text will be
duplicated.
•You can prepare your solutions however you like (handwriting, L
A
T
E
X, etc.), but you must submit them
in PDF. You can scan written solutions in the library or using a smartphone (with a scanner app like
CamScanner). It is up to you to ensure that submissions are legible.
•Please give every PDF file a unique filename.
–If you’re making a complete submission (all problems), name your PDF file netid-hw2.pdf, where
netid is replaced with your NetID.
–If you’re submitting some problems now and other problems later, name your file netid-hw2-123.pdf,
where 123 is replaced with just the problems you are submitting now.
–If you use the same filename twice, only the most recent version will be graded.
–The time of submission is the time the most recent file was uploaded.
•If you use L
A
T
E
X and want to draw something like a state diagram, consider using the tikz package.
A reference document is on the website under “Assignments”.
•Submit your PDF file in Sakai. Don’t forget to click the Submit (or Resubmit) button!
Practice Problems
These problems are from the book, and most have solutions listed for them. They are listed here for you to
practice on as needed and any answers you generate should not be submitted. You are free to discuss these
with others, but you are not allowed to post solutions to any public forum.
1. 1.7a,f NFA state diagrams with fixed number of states
2. 1.11 NFAs need only 1 accept state
3. 1.16a NFA to DFA
4. 1.10b,c Regex to NFA
5. 1.20 Regex to strings
6. 1.21a DFA to regex
7. 1.28 regex to NFA
1
