|
Course Outcome (CO)
|
At the end of course , the student will be able to
|
Bloom’s Level
|
| CO 1 |
Define various types of automata for different classes of formal languages and
explain their working. |
K 1, K 2
|
| CO 2 |
State and prove key properties of formal languages and automata. |
K 1, K 3
|
| CO 3 |
Construct appropriate formal notations (such as grammars, acceptors, transducers
and regular expressions) for given formal languages. |
K3, K4 |
| CO 4 |
Convert among equivalent notations for formal languages. |
K3 |
| CO 5 |
Explain the significance of the Universal Turing machine, ChurchTuring thesis
and concept of Undecidability. |
K 2
|
