Computer Sciences > Gate 2022 > Finite Automata
Which one of the following regular expressions correctly represents the language of the finite automaton given below?
A
(ab*bab*+ ba*aba*)
B
(ab*b)*ab+(ba*a)* ba*
C
(ab*b+ ba*a)* (a*+b*)
D
(ba*a+ ab*b)* (ab*+ba*)

Correct : d

Similar Questions

A regular language L is accepted by a non-deterministic finite automaton (NFA) with n states. Which of the following statement(s) is/are FALSE?
#1371 MCQ
Consider the following deterministic finite automaton (DFA) defined over the alphabet, Σ={a,b}. Identify which of the following language(s) is/are accepte...
#1393 MCQ
Let Σ={1,2,3,4}. For x∈Σ*, let prod(x) be the product of symbols in x modulo 7. We take prod(ε)=1, where ε is the null string.F...
#1467 NAT

Related Topics

regular expressions GATE 2022 finite automaton GATE language regular expression computer science gate GATE CS 2022 regex FA FA representation GATE question 41

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: