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
- B
- C
- D
Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)MCQ2 marks · −2/3 if wrongMedium

A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.