Gate 2023 paper solved | Ques 14 | DFA to expression
Question Statement:
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?
Solution:
I hope the solution helped you!
Please don’t forget to subscribe to keep such wonderful solutions coming your way! Till then good bye, have a wonderful day 🙋♂️
