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 • 204 views