Regular Language and Finite Automata|| (1 Mark)||MCQ||2022

Last Updated :
Discuss
Comments

Which one of the following regular expression correctly represents the language of the finite automata given below?

Screenshot-2025-08-30-164451
.

[GATE 2022|| MCQ|| 1-mark]

ab*bab*+ba*aba*


(ab*b)*ab* + (ba*a)* ba*


(ab*b+ba*a)(a*+b*)


(ba*a+ab*b)*(ab*+ba*)

This question is part of this quiz :

GATE||Regular Language and Finite Automata|| Pyq (2010 to2025),GATE||TOC || Pyq (2010 to2025)
Tags:
GATE CS
GATE
Theory of Computation
GATE CS
Share your thoughts in the comments
Article Tags :