We are specializes in:- 1. College projects(Software) 2. Guidance for exam preparation 3. Result oriented teaching 4. Interview preparation 5. Special care for weak student

Topics Covered

Grammars - Production systems - Chomskian Hierarchy - Right linear grammar and Finite state automata - Context free grammars - Normal forms - uvwxy theorem – Parikh mapping - Self embedding property - Subfamilies of CFL - Derivation trees and ambiguity. Finite state Automata - Non deterministic and deterministic FSA, NFSA with ?- moves, Regular Expressions - Equivalence of regular expression and FSA . Pumping lemma , closure properties and decidability. Myhill - Nerode theorem and minimization - Finite automata with output. Pushdown automata - Acceptance by empty store and final state - Equivalence between pushdown automata and context-free grammars - Closure properties of CFL - Deterministic pushdown automata. Turing Machines - Techniques for Turing machine construction - Generalized and restricted versions equivalent to the basic model - Godel numbering - Universal Turing Machine - Recursively enumerable sets and recursive sets - Computable functions - time space complexity measures - context sensitive languages and linear bound automata. Decidability; Post's correspondence problem; Rice's theorem; decidability of membership, emptiness and equivalence problems of languages. Time and tape complexity measures of Turing machines; Random access machines; the classes P and NP; NP-Completeness; satisfiability and Cook's theorem; Polynomial reduction and some NP-complete problems. Advanced topics; Regulated rewriting L systems; Grammar systems. New paradigms of computing; DNA computing; Membrane computing.

Who should attend

B.Tech/BCA/MCA/M.Tech students from any university can attend this course.

Pre-requisites

Course timing - 5 months and Course fees - Rs 600 per month.

What you need to bring

Exercise Copy and Pen Drive

Key Takeaways

Develop methods by which computer scientists can describe and analyze the dynamic behavior of discrete systems.