ID.No: Don’t Write anything on the Question Paper Except Id.

Num

Rajiv Gandhi University of Knowledge Technologies

(Department of Computer Science and Engineering)

MONTHLY TEST-1
Year/Sem: E2/SEM-1 Date: 20.01.2022
Subject: FLAT Time: 2 Hrs.
Subject Code: Max. Marks : 40M

Answer ANY FOUR from the following. [4 * 10 = 40 M]

1. a) Construct minimal DFA that accepts all strings of 0’s and 1’s where each string ends with substring
101. [5M]
b) Construct minimal DFA that accepts all strings of a’s and b’s such that no two adjacent symbols are
same. [5M]
2.a) Design NFA that accepts all strings over {a,b,c}* such that the first and last symbols are different.
[5 M]
b) Construct minimal DFA that accepts all strings of 0’s and 1’s where each string contains either 000
or 111 as substring. [5 M]
3.a) Design minimal DFA that accepts all names over {A,B,…,Z}* such that the length of the name is
atleast 3 and starts with either S or R. [5 M]
b) Design NFA that accepts all strings of 0’s and 1’s where each string contains even number of 1’s.
[5 M]
4. Construct DFA with minimum number of states for the following ϵ-NFA. [10 M]

5. Construct the equivalent NFA for the following ϵ- NFA. [10 M]

ID.No: Don’t Write anything on the Question Paper Except Id.Num

6. Find the minimized FSM for the following FSM. [10 M]

7. Given a string of length ‘n’, derive a formula to find the total number of substrings, total number of
prefixes and total number of suffixes. Demonstrate each with an example. [10 M]

8. Minimize the following FSM. [10 M]