GATEverse Practice, past papers & mock tests
GATE 2023 · CS - Forenoon
Theory of ComputationFinite Automata: Regular LanguageseasyMCQ1 mark
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?
Save your progress

Related Theory of Computation PYQs