School of Information Technology & Engineering (SITE)

Programme : M.Tech-SE
Course: Theory of Computation (SWE-1006)

Digital Assignment-I
Submission Deadline: 18-10-2019
1. Write a program in any programming language to simulate finite automata to validate an
identifier.

2. Explain with examples the real time applications of Finite Automata, Regular Expressions,
and Context free grammars.

3. Design a DFA for the following languages using JFLAP tool:

i. L={abnam : n ≥ 2,m ≥ 3}
ii. L={bnam: n, m ≥1}

4. Construct an NFA that recognizes the regular expression (aa+bb)(a+b)*

5. State whether L={anbn | n > 0} is non regular.

6. How to convert a Regular Expression to left-linear grammar (0+1)*00(0+1)*

7. Define regular expression and regular set. Find an equivalent regular expression to the
following DFA-

8. Construct the minimum state automaton equivalent to the transition diagram:

9. Every non deterministic finite automaton is a deterministic finite automaton. If yes, justify
your answer with suitable example.

10.
11. Convert the following context free grammar G into Greibach Normal Form
S→ AB | 0
A→ BC | 1
B→ CD | 2
C→ AD | 0
D→ 1

12.

13. Explain the Phases of Compiler with suitable example.

14. Explain Linear, Hierarchical, and Semantic Analysis with suitable example.