ASSIGNMENT SHEET ON “REGULAR LANGUAGES AND FINITE AUTOMATA”

PAPER CODE: PCC-CSE 502 | DATE OF ALLOCATION & SUBMISSION: 03.02.2021

1. Prove that the language L = {an bn + 1 | n > 0} is non-regular, using pumping lemma.

2. Construct regular expressions defined over the alphabet ∑ = {a, b}, which denote the following languages:
i) All strings without a double a.
ii) All strings in which any occurrence of the symbol b, is in groups of odd numbers.
iii) All strings in which the total number of a’s is divisible by 2.

3. Describe in English the sets denoted by the following regular expressions:

(i) (a + ϵ) (b + ba)*
(ii) (0*1*)*

4. Construct an NFA with ϵ -moves, which accepts the language defined by:
[(0 + 1)* 10 + (00)* (11)*]*

5. Construct the regular expression and finite automata for: L = L1 ∩ L2 over alphabet {a, b}, where:
L1 = all strings of even length
L2 = all strings starting with b

6. Construct the regular expressions for the following DFAs:

(a) (b)

7. Compare Mealy and Moore machines. Design a Mealy machine to replace each occurrence of sub-string
‘abb’ by ‘aba’, where ∑ = {a, b}.

8. Convert the following NFA into NFA without ϵ-moves.