FORMAL LANGUAGES AND AUTOMATA THEORY
Formal Languages and Automata theory presents the theoretical aspects of computer science, and helps define infinite languages infinite ways; construct algorithms for related problems and decide whether a string is in language or not. These are of practical importance in the construction of compilers and designing of programming languages, thus establishing the course as a core paper in the third/fourth year of various universities.
The Highlights of this Formal Languages and Automata theory 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.
9.Total 5 TM problems and solutions clearly explained.
10. Equivalence of 2 DFAs
11. Introduction to Pushdown Automata
12.Total 8 Pushdown Automata problem
Who this course is for:
- Computer Science & Engineering and Information technology students
What Will I Learn?
- Formal Languages and Automata theory