Let M be the 5-state NFA with \epsilon-transitions shown in the diagram below. Which one of the following regular expressions represents the language accepted by M?

GATE 2024 CSE & IT Q41 — Computer Science

GATE 2024Set 2Q41MCQanswer keyexplanation soonmedium

Computer Science · Theory of Computation - Regular Expressions and Finite Automata

Concept intelligence

Jump into a concept drill from this question.

Figure from the original GATE 2024 paper. (IISc Bangalore archive)

Studying seriously for GATE CSE?

Keep browsing free. Pro unlocks the paid study loop: explanations, topic mastery, mistake notebook, and custom PYQ drills.

Recurring concept

Theory of Computation - Regular Expressions and Finite Automata has appeared in GATE CSE & IT 2 times across 1 years (2024).

More questions on Theory of Computation - Regular Expressions and Finite Automata

📊 has diagram

NFAepsilon transitionsregular expressionslanguage accepted