Consider the Deterministic Finite-state Automaton (DFA) A shown below. The DFA…

GATE · 2023 · CS · Computer Science & IT

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. A.

    1(0∗11)∗

  2. B.

    0(0 + 1)∗

  3. C.

    1(0 + 11)∗

  4. D.

    1(110∗)∗

Attempted by 256 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…