Consider the Deterministic Finite-state Automaton (DFA) $\mathcal{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 $\mathcal{A}$?

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?

Topic-wise GATE CS PYQs with verified steps