Question

Q1. Construct a regular expression (RE) defining each of the following languages

over the alphabet Σ={a,b}

a) All strings with exactly two a’s.

b) All strings that have at most one ‘a’ and at most one ‘b’.

​

Answer 1

Answer:

Q1. Construct a regular expression (RE) defining each of the following languages

over the alphabet Σ={a,b}

b) All strings that have at most one ‘a’ and at most one ‘b’.