a b a is RE for the language defined over S a b having words-04851
(a + b)* a is RE for the language defined over S={a,b} having words not ending in b
This multiple choice question (MCQ) is related to the book/course
vu cs402 Theory of Automata.
It can also be found in
vu cs402 Mid Term - Quiz No.6.
(a + b)* a is RE for the language defined over S={a,b} having words not ending in b
TRUE
FALSE
Such a language is not regular
None of the given options
