How to solve the following problem by state elimination method and arrive at the regular expression $(a + \epsilon) (ab)^* (b + \epsilon)$? Find the regular expression for the language $L$ = set of all the strings over $\sum = {a, b}$ where no $2$ $a$'s and no $2$ $b$'s come together.

asked
Apr 24, 2020
in Theory of Computation
intgate
9 points
28 views