This is a specially designed course to understand the fundamental and crical aspects with precise information. The material is very simplified so it gives a practical feeling of the subject. Theory is related with the real time examples and short techniques to simplify and solve critical problems.

Topics Covered

1) Basics 2) Finite State Machines (why FSM, How to draw FSM, STF,MAF) 3) Finite Automata (NFA,DFA, NFA -> DFA) 4) Regular Languages (Representation) 5) Minimization of DFA (Mealy machine and Moore Machine, Conversion from Mealy to Moore and moore to Mealy) 6)Context Free grammer (CFG) 7) Regular Grammer 8) Push Down Automata 9) Turing Machines 10) Intactable Problems

Who should attend

1) Engineering Students with Computer Science Or IT background. 2) GATE 2014 - Aspirants from Computer Science 3) MCA students

Pre-requisites

basic mathematics.

What you need to bring

Notebook to solve the assignments with us.

Key Takeaways

1) we shall be through with understanding of the subject both theoritically and practically. 2) you will remember the proofs 3) you will understand how all the chapters are interlinked. 4) We shall understand the practical application of this subject. 5) It will help us in strengthning our semester paper and placement interviews.