Let π be the 5-state NFA with π-transitions shown in the diagram below.β¦
GATE Β· 2024 Β· CS Β· Set 2 Β· Computer Science & IT
Let π be the 5-state NFA with π-transitions shown in the diagram below.
Which one of the following regular expressions represents the language accepted by π ?
- A.
(00)β + 1(11)β
- B.
0β + (1 + 0(00)β )(11)β
- C.
(00)β + (1 + (00)β )(11)β
- D.
0+ + 1(11)β + 0(11)β
Attempted by 222 students.
Sign up free to check your answer
Sign up freeLoading lessonβ¦