Exams › GATE › Technical
Consider the Deterministic Finite-state Automaton (DFA) A shown below. The DFA runs on the alphabet {0,1}, and has the set of states {s,p,q,r}, with s being the start state and p being the only final state.
Which one of the following regular expressions correctly describes the language accepted by A?
- 1(0*11)*
- 0(0 + 1)*
- 1(0 + 11)*
- 1(110*)*
Correct answer: 1(0 + 11)*
Solution
The correct option, 1(0 + 11)*, accurately represents the language accepted by the DFA because it starts with a '1' followed by any combination of '0's and '11's, which aligns with the transitions and final state conditions of the automaton.
Related GATE Technical questions
⚔️ Practice GATE Technical free + battle 1v1 →