Theory of Computation - Regular Expressions and Finite Automata

GATE CSE & IT · 2 questions across 1 years (2024-2024) · 3% recurrence rate

Start topic drill Back to CSE & IT

Recurrence sparkline

2024–2024

20242024

Difficulty mix

med 100%

Question types

MCQ2

All 2 questions on Theory of Computation - Regular Expressions and Finite Automata

2024 Q22

Which one of the following regular expressions is equivalent to the language accepted by the DFA given below?

Med✓📊

2024 Q41

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?

Med✓📊