55PDFILEEEE

CSE 355: Module 4 Formal Conversion (NFA/Regular Expression Equivalence)Prof. Dr. Jamison W. Weber
Arizona State University, Fall 2024
This problem set should be completed in groups of four. Upload a single PDF containing all group members’
names and your complete solutions to Gradescope. You may resubmit as many times as needed before
the deadline, which is listed on Canvas and Gradescope. Please review the instructions on Canvas for
collaboration tools, submission guidelines, and grading criteria.
Problem 1
Convert the following regular expression to an NFA.
(10⋆ 1 ∪ 1⋆ )
Last Updated: August 1, 2024
⋆
Page 1 of 2
© 2024, Dr. Jamison W. Weber
ASU, Fall 2024
CSE 355: Module 4 Formal Conversion
NFA/Regular Expression Equivalence
Problem 2
Assume the alphabet is Σ = {0, 1}. Convert the following NFA to a regular expression using the state ripping
technique shown in lecture. Rip the states in the following order: q0 , q1 , q2 .
0, 1
ϵ, 0
q0
q1
0, 1
1
1
q2
Last Updated: August 1, 2024
Page 2 of 2
© 2024, Dr. Jamison W. Weber