About the Course
We give the students knowledge of number of areas in theoretical computer science, formal languages and automata theory.
We provide computer science coaching from many years to the students of Punjab Technical University (PTU), Panjab University (PU), Punjabi University, Kurukshetra Unversity (KU), Maharishi Markandeshwar University (MMU) and even the students have arrived from foreign university like University of Leicester, United Kingdom to study from us. 100% pass result has been achieved till now.
Topics Covered*Basics of Strings and Alphabets
*Finite Automata–DFA, transition graphs, regular languages, non-deterministic FA,
equivalence ofDFA and NDFA
*Regular grammars, regular expressions, equivalence between regular languages,properties of
regular languages, pumping lemma.
*Context Free Languages–Leftmost and rightmost derivation, parsing andambiguity, ambiguity in grammar and languages, normal forms
*Pushdown Automata–NDPDA, DPDA, context free languages and PDA,comparison ofdeterministic and non-deterministic versions, closure properties, pumpinglemma for CFL
*Turing Machines, variations, halting problem, PCP
*Chomsky Hierarchy,LR(k) Grammars, properties of LR(k) grammars, Decidability and Recursively Enumerable Languages
Who should attendFor computer science engineering students.
Pre-requisitesDiscrete mathermatics knowledge is a plus point
What you need to bringNotebook and pen
Key TakeawaysBasic knownledge about various aspects about Formal language Automata Theory and Theory of Computation