What You Will Learn!
- Formal Languages and Automata theory
Description
The Highlights of the of the course:
1.Introduction to Automata theory.
2.Types of Formal Languages(Chomsky hierarchy).
3.Finite Automata and Types.
4.Total 22 DFA problems and solutions clearly explained.
5. DFA Conversions,Operations & Equivalence.
6. DFA minimization using
a. Equivalence method.
b.Table filling method.
6. Pushdown Automata.
7.Total 8 PDA problems and solutions clearly explained.
8.Turing machines.
9.Total 5 TM problems and solutions clearly explained.
Who Should Attend!
- Computer Science & Engineering and Information technology students
