Question: Give a regular expression for language over the alphabets $\sum = {a,b} $ containing at the most two a's
0

Mumbai University > Informatica Technology > Sem 4 > Automata Theory

Marks: 5M

automata theory • 154 views
ADD COMMENTlink
modified 7 weeks ago by gravatar for RB RB100 written 5 months ago by gravatar for pratikj2208 pratikj22080
0

RE for language having two a's :

b * + b * ab * + b * ab * ab *

ADD COMMENTlink
written 7 weeks ago by gravatar for RB RB100
Please log in to add an answer.