Final Term Assignment Sction: A (PC)

Write down the answers and make pdf and upload here.

1. Convert the following regular expression to Regular Language:

Consider {0,1} as input in all the cases.

a. {w| the length of w can be divisible by 4}

b. {w| w has lenght at least 4 and its third symbol is a 1}

2. Find out the regular language for the following expression and give 2 string that supported this expression and two string that doesn't supported the expression.

a. ab + ba+ bab

3. Find out a equvalance finite automata for the following expression:

a.  0* + 1*