The language of all words made up of as and bs with at least-04894
The language of all words (made up of as and bs) with at least two as can not be described by the regular expression.
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.11.
The language of all words (made up of as and bs) with at least two as can not be described by the regular expression.
a(a+b)*a(a+b)*(a+b)*ab*
(a+b)* ab* a(a+b)*
b*ab* a(a+b)*
none of these
