|
ITUL402.1
|
Summarize the fundamental theoretical components of the Finite Automata, Chomsky hierarchy, including formal definitions of grammar, machine models, and the basic properties of various language classes. |
| ITUL402.2 |
Apply the concept of formal languages and automata for designing finite state machines and establishing equivalence between these machines. |
| ITUL402.3 |
Implement the fundamentals of Chomsky hierarchy, regular expressions, and regular grammars and find their relationship with finite automata |
| ITUL402.4 |
Illustrate the concept of CFG, Push Down Automata (PDA) and Turing Machines for modeling the solution for various computational problems. |
| ITUL402.5 |
Analyze recursive and recursively enumerable languages along with linear bounded automata and context-sensitive languages for classifying computational problems and examining their decidability. |
