Find a regular expression for a grammar which generates a language which states : L contains a set of strings starting w
Posted: Thu Jul 14, 2022 9:26 am
a) a(a*Ub*)b
b) a*(aUb)b*
c) a(a*b*)b
d) None of the mentioned
b) a*(aUb)b*
c) a(a*b*)b
d) None of the mentioned