Q.1. Write Regular Expressions (RE) for the following languages:
- The language of all strings defined over Σ = {U, V, W} that begins with V, ends with U and having minimum length of 3.
- The language of all strings defined over Σ = {U, V, W} with V as the third letter and W being the second last letter.
[Marks 4+4]
Q.2. Draw Finite Automata (FA) for the languages in Q.1
[Marks 6+6]