Note :1)Dont leave empty cells 2)dont merge the cell 3) rows with out date will be not

be uploaded in to the server Date YYYY/MM/DD Format 2013/12/10 2013/12/13 2013/12/13 2013/12/17 2013/12/20 2013/12/20 2013/12/21 2013/12/24 2013/12/27 2013/12/27 2013/12/28 2013/12/31 2014/01/03 2014/01/03 2014/01/04 2014/01/07 2014/01/10 2014/01/10 2014/01/21 2014/01/24 2014/01/24 2014/01/25 2014/01/28 2014/01/31 2014/01/31 2014/02/01 2014/02/04 2014/02/07 2014/02/07 2014/02/18 2014/02/21 2014/02/21 2014/02/22 2014/02/25 2014/02/28 2014/02/28 2014/03/01 2014/03/04 2014/03/07 2014/03/07 2014/03/11 2014/03/14 UNIT NO ( USE digits only) 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 4 4 4 4 4 5 5 5 5 5 5 6 6 6 6 6 6 7 7 7

2014/03/14 2014/03/15 2014/03/18 2014/03/21 2014/03/21 2014/03/22 2014/03/25 2014/03/28 2014/03/28 2014/03/29 2014/04/01 2014/04/04 2014/04/04 2014/04/05

7 7 7 7 7 8 8 8 8 8 8 8 8 8

y cells ell ate will be not be uploaded in to the server

Topic Planed to cover Fundamentals : Strings, Alphabet, Language Operations, Finite state machine, definitions, finite automaton model acceptance of strings &languages DFA, NFA transition diagrams Language recognizers NFA, DFA Revision, MOCK TEST I NFA with transitions - Significance acceptance of languages, Conversions and Equivalence Equivalence between NFA with transitions Equivalence between NFA with transitions, BRIDGE CLASS 1 NFA to DFA conversion minimisation of FSM, equivalence between two FSMs Finite Automata with output- Moore machines Finite Automata with output-Melay machines, BRIDGE CLASS 2 Regular Languages : Regular sets, regular expressions, identity rules Constructing finite Automata for a given regular expressions Conversion of Finite Automata to Regular expressions, BRIDGE CLASS 3 Conversion of Finite Automata to Regular expressions Pumping lemma of regular sets Pumping lemma of regular sets Closure properties of regular sets (proofs not required), BRIDGE CLASS 4 Regular grammars-right linear and left linear grammars equivalence between regular linear grammar and FA inter conversion, Context free grammar derivation trees, Sentential forms., BRIDGE CLASS 5 Right most and leftmost derivation of strings Context Free Grammars:- Ambiguity in context free grammars Minimisation of Context Free Grammars, BRIDGE CLASS 6 Chomsky normal form Greiback normal form Pumping Lemma for Context Free Languages Enumeration of properties of CFL (proofs omitted), BRIDGE CLASS 7 Push down automata, definition, model acceptance of CFL Acceptance by final state and acceptance by empty state and its equivalence Equivalence of CFL and PDA, BRIDGE CLASS 8 Interconversion. (Proofs not required) Introduction to DCFL and DPDA Turing Machine, MOCK TEST 2, BRIDGE CLASS 9 Turing Machine, definition, model , design of TM Computable functions

Computable functions Recursively enumerable languages, BRIDGE CLASS 10 Churchs hypothesis Counter machine Types of TM Chomsky hierarchy of languages, BRIDGE CLASS 11 linear bounded automata and context sensitive language LR(0) grammar, decidability of, problems Universal Turing Machine, Undecidability of posts Correspondence problem, Turing reducibility, BRIDGE CLASS12 Turing reducibility, Definition of P and NP problems Definition of P and NP problems NP complete and NP hard problems NP complete and NP hard problems