Question

Write a regular expression for the set of all words
with no two consecutive a's.
2​

Answer 1

Explanation:

Give all the strings of length three or less accepted by the automaton. ∈, a, b .Write regular expressions for the following languages. This is the language of strings with no two consecutive 1.