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?
A.
1(0∗11)∗
B.
0(0 + 1)∗
C.
1(0 + 11)*
D.
1(110∗)∗
Solution:
In the given DFA r is the dead state which can be removed from the DFA. So the regular expression for the DFA should be 1(0 + 11)*.
