With this course students can cover the following areas:
Introduction, Some fundamental concepts on alphabets and strings, Formal Languages, Finite Representation of Languages, and Grammars.
Context fee Grammars, The Chomsky hierarchy of Grammars, Derivations, Derivation trees, Transition Systems, Introduction to Computational models, Power of machines, Finite State Machines, Computation with fi nite automation, Finite automation as recognizers of languages, Accessibility and equivalence of Finite Automata, Non-Deterministic finite machines, NFA with transitions, Transformation of NFA into DFA, Partitions and equivalence relations.
