PART-A
1 Define Regular expression. Give an example.2 What are the operators of RE.
3 Write short notes on precedence of RE operators.Write Regular Expression for the language that have the set of strings over {a,b,c} containing at least one a and at least one b.
4 Write Regular Expression for the language that have the set of all strings of 0’s 5 and 1’s whose 10
the symbol from the right end is 1.
6 Write Regular Expression for the language that has the set of all strings of 0’s and 1’s with at most one pair of consecutive 1’s.
7 Write Regular Expression for the language that have the set of all strings of 0’s
8 and 1’s such that every pair of adjacent 0’s appears before any pair of adjacent 9 1’s.
10 Write Regular Expression for the language that have the set of all strings of 0’s and 1’s whose no of 0’s is divisible by 5.
11 Write Regular Expression for the language that has the set of all strings of 0’s and 1’s not containing 101 as a substring.
12 Write Regular Expression for the language that have theset of all strings of 0’s and 1’s such that no prefix has two more 0’s than 1’s, not two more 1’s than 0’s.
13.Write Regular Expression for the language that have the set of all strings of 0’s and 1’s whose no of 0’s is divisible by 5 and no of 1’s is even.
