Question

1. find a regular expression corresponding to each of the following over the alphabets Σ=[0,1]. the language of all strings ending with 1 and not contain 00

1. the set of strings over Σ={a,b} in which there are at least two occurrence of b between any two occurrence of a

Answer 1

1.

In a regular expression, the first symbol will be 1 and the last symbol will be zero.

The required regular expression

R = 1 (0+1)* 0 

2.

R = (b + (abbb*a))*