DEPARTMENT OF INFORMATION TECHNOLOGY

VASAVI COLLEGE OF ENGINEERING

COURSE: THEORY OF AUTOMATA
ASSIGNMENT RUBRIC FOR EVALUATION
Exemplary (E)

Assignment
1

Assignment
2

Assignment
3

Demonstrate
a thorough
understanding
on (i) finite
state
automata, (ii)
regular
expression
and regular
languages,
and (iii)
equivalence
of NFA and
DFA

Accomplished
(A)
Demonstrate
a good
understanding
on (i) finite
state
automata, (ii)
regular
expression
and regular
languages,
and (iii)
equivalence
of NFA and
DFA

Demonstrate
a thorough
understanding
on (i)
properties of
regular
languages (ii)
context free
grammars
and (iii)
equivalence
and
minimization
of finite
automata.

Demonstrate
a good
understanding
on (i)
properties of
regular
languages (ii)
context free
grammars
and (iii)
equivalence
and
minimization
of finite
automata.

Can describe
and explain
the concepts
of (i) push
down
automata, (ii)
properties of
CFL and (iii)
normal forms
for CFGs
Can
describe and
explain the

Can describe
and explain
mostly the
concepts of
(i) push down
automata, (ii)
properties of
CFL and (iii)
normal forms
for CFGs
Can
describe
and explain

Developing (D)
Demonstrate
a
considerable
understanding
on (i) finite
state
automata, (ii)
regular
expression
and regular
languages,
and (iii)
equivalence
of NFA and
DFA
Demonstrate
a
considerable
understanding
on (i)
properties of
regular
languages (ii)
context free
grammars
and (iii)
equivalence
and
minimization
of finite
automata.
Can describe
and explain
considerable
concepts of
(i) push down
automata, (ii)
properties of
CFL and (iii)
normal forms
for CFGs
Can
describe and
explain

Beginning (B)

Demonstrate a minimal (or unable to demonstra

understanding on (i) finite state automata, (ii) re
expression and regular languages, and (iii) equiv
NFA and DFA

Demonstrate a minimal (or unable to demonstra

understanding on (i) properties of regular langua
context free grammars and (iii) equivalence and
minimization of finite automata.

Can describe some concepts of (or cannot descr

of )
(i) push down automata, (ii) properties of CFL a
normal forms for CFGs

Can describe some concepts of (or cannot desc

of )
Turing Machines

Assignment
4

concepts of
Turing
Machines
Can
effectively
and
correctly
apply
formal
methods to
solve a
given
problem

mostly the
concepts of
Turing
Machines
Can
correctly
apply
formal
methods to
solve a
given
problem

considerable
concepts of
Turing
Machines
Can apply
formal
methods to
solve a
given
problem
with some
degree of
effectivenes
s

Can apply some formal methods (or cannot app

methods) to solve a substantial part of a given p