engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Regular Languages and Finite Automata Regular Languages
Which regular expression best describe the language accepted by the non-deterministic automaton below?
1
(a+b+c)*baa
2
(a+b+c)*bca
3
(a + b + c)*b(c + a)a
4
(a + b + c)*b(a + c)a+