0

1.3kviews

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

written 5.9 years ago by pratikj2208 • 140

modified 4.7 years ago by prashantsaini • 0

automata theory

ADD COMMENT FOLLOW SHARE EDIT

1 Answer

0

30views

written 5.6 years ago by teamques10 ★ 68k

RE for language having two a's :

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

ADD COMMENT SHARE EDIT