Theory of Automata

Assignment # 1
Due Date: 23/10/2020 Total Marks: 50

Program: BSCS
Instructions
1. Understanding of the problems is part of the assignments. So no query please.
2. You will get Zero marks if found any type of cheating.
3. 25 % deduction of over marks on the one day late submission after due date
4. 50 % deduction of over marks on the two day late submission after due date
5. No submission after two days.

Q. Construct RE’s for Following. (5 Marks for each)

When  = {0, 1}

1. {w : w contains at least three 1s}.

2. {w : w contains at least two 1s and at most one 0},

3. {w : w contains an even number of 0s and exactly two 1s}.

4. {w : w contains exactly two 0s and at least two 1s}.

5. {w : w contains an even number of 0s and each 0 is followed by at least one 1}.

6. {w : every odd position in w is 1}.

7. {w| w is any string except ‘00’ and ‘111’}

When  = {c, d}

8. {w| third position of the w is ‘d’

9. {w| length of w is multiple of three.

10. All words whose second last symbol is ‘c’.