fundamentals concept of toc
Union, Intersection, Difference, Concatenation, kleen * closure
formal definition of grammer in toc
Type 0, Type 1,Type 2,Type 3
computational models, Noncomputational models in toc
DFA in toc
NFA in toc
difference between dfa and nfa in toc
conversion from nfa to dfa in toc
epsilon nfa in toc, epsilon moves,convert epsilon nfa to nfa
Equivalence of NFA and DFA in toc
Two-Way Finite Automata in toc
Moore Machine in toc
Mealy Machine in toc
Conversion between Moore and Mealy Machine in toc
Regular Expression and Languages in toc
important identites
conversion between RE to FA
convert DFA to RE in toc
DFA Minimization using Equivalence Theorem
DFA Minimization using Myhill-Nerode Theorem
Notes of PDA by JP Notes
Differenc between DPDA and NPDA in toc
PDA Questions in toc
Derivation (Leftmost Derivation, Rightmost Derivation), parse tree,S grammar or Simple Grammar in toc
Ambiguity in Grammar in toc
Chomsky's Normal Form, Greibach Normal Form (Steps for converting) in toc
Basic Model of Turing machine, Instantaneous Description (ID), example in toc