Question 8213 – GATE 2015 [Set-2]
February 9, 2024Question 7833 – GATE 2018
February 10, 2024Question 10881 – GATE 2006-IT
Which regular expression best describes the language accepted by the non-deterministic automaton below?
Correct Answer: A
Question 5 Explanation:
(a + b)* a(a + b)b
(abb)*
(a + b)* a(a + b)* b(a + b)*
(a + b)*