ASSIGNMENT No 1

COURSE : AUTOMATA THEORY AND COMPILER DESIGN TIME : 9.00 AM to 04.45 PM

COURSE
: 21CS51 DATE : 01/01/2024
CODE
MAX.
SEM : 5th Sem : 20
MARKS
Si.No Marks Co BTL
1. Define DFSM. Design a DFSM to accept each of the following
languages:
1. L= {w; where |w| mod 3 where ∑={a}} 5 1 L3
2. To accept strings over {a,b} such that each block of
5(length five) consecutive symbols have at least two a’s
2. Convert the following NDFSM to DFSM.

5 1 L3

3. Consider the following NFA with ϵmoves. Construct an

equivalent DFA

5 1 L3

4. Define distinguishable and indistinguishable states.

Minimize the following DFSM.
δ 0 1
A B A
B A C
C D B 5 1 L3
*D D A
E D F
F G E
G F G
H G D
CO1 L2 Acquire fundamental understanding of the core
concepts in automata theory and Theory of
Computation Bloom’s Taxonomy
CO2 L3 Design and develop lexical analyzers, parsers and Level
code generators
L1 Remembering
CO3 L3 Design Grammars and Automata (recognizers) for
different language classes and become knowledgeable L2 Understanding
about restricted models of Computation (Regular,
Context Free) and their relative powers. L3 Applying

CO4 L2, Acquire fundamental understanding of the structure of L4 Analyzing

L3 a Compiler and Apply concepts automata theory and L5 Evaluating
Theory of Computation to design Compilers.
CO5 L3 Design computations models for problems in L6 Creating
Automata theory and adaptation of such model in the
field of compilers