Formal definitions of grammars and acceptors, deterministic and nondeterministic systems, grammar ambiguity, finite state and push-down automata, and normal forms will be discussed.
PDF, model books
Knowledge of discrete mathematics and logic.
WHAT AM I ABLE TO GET OUT OF THIS COURSE
To have a solid understanding of models of computation, the limits that are imposed by the very nature of computation, and the ubiquity of unsolvable problems.
Additional reading will be given to students.
Course Certificate :-
For any query give a miss call: