INDEX | TOC - Theory Of Computation

INDEX
THEORY OF COMPUTATION
SNO	TOPICS
1	TOC-Introduction
2	Concept of Finite Automata
3	Representation of Finite Automata
4	Concept of Epsilon|Null value
5	Construction of Finite Automata
6	Finite Automata with Epsilon Moves
7	Minimization of Finite Automata
8	DFA-Deterministic Finite Automata
9	NDFA|NFA - Non Deterministic Finite Automata
10	NDFA to DFA Conversion
11	NDFA to DFA Conversion with Epsilon
12	NFA to DFA Conversion (Short cut method)
13	NFA to DFA Conversion
14	Regular Expression (RE)
15	Conversion of RE to FA
16	Conversion of FA to RE
17	Rule For Constructing Arden's Equation
18	Grammar - Introduction
19	CNF-Normal Form of Grammar
20	GNF-Normal Form of Grammar
21	Type of Grammar
22	Moore and Mealy Machine
23	Turing Machine with Examples
24	Mathematical Induction
25	Theorems 1.Regular expression (R.E) is closed under union operation. 2.Regular language are closed under concatenation                    OR    If L1 and L2 are regular than L1L2 are also regular. 3. Regular expression is closed under kleen closure. 4. Regular expression is closed under positive closure. 5. Construct an finite automata which accept a string does not end with 0 and 1's                    OR    If L is regular than L' is also regular                    OR    Regular language / Expression are closed under compliment .
26	Pumping Lemma