Which one of the following regular expressions correctly represents the language of the finite automaton given below?


- A
- B
- C
- D
Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)MCQ1 mark · −1/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.