CIS-317: Theory of Automata
Quiz4
Name:-
Total Marks: 10
Time: 10 Minutes
Write the Regular Expression that gives the same language as the NFA given below.
Solution:
The step by step state elimination is given below. You may choose the order of state according
to your own preference. Writing the regular expression directly would also earn you full credit.
1
q0
q1
q3
q2
2
1
0,1
0,1
0,1
1
0,1
q0
q1
q2
2
1
0+1
0+1
0+1
11*(0+1)
q0
q1
q2
2
1
0+1
0+1
(0+1) + 11*(0+1)
q0
q2
2
0+1
0+1
1 ( (0+1) + 11*(0+1) )
q0
q2
2
(0+1)*1( (0+1) + 11*(0+1) ) (0+1)*
(0+1)*1( (0+1) + 11*(0+1) ) (0+1)*
docsity.com