Which regular expression best describes the language accepted by the non-deterministic automaton below?👁 download (7)
(a + b)* a(a + b)b
(abb)*
(a + b)* a(a + b)* b(a + b)*
(a + b)*
This question is part of this quiz :
