Modelling Computation
Algebraic Method Using Arden's theorem.
Applications of Finite Automata
Turing Machine Examples
Finite Automata
Context Free Languages
Turing Machines
Undecidability
Computational Complexity & Rice's theorem
Prenex & Skolem Normal Forms
Minimization of Finite Automata
Simplification Of CFG
Normal Forms Of CFG
CYK - Algorithm
QUESTION BANK
MODEL PAPER
YEAR 2005-2006-2007
QUESTION BANK
SOLUTIONS
TEXT BOOKS
MCA
ELEMENTS OF THE THEORY OF COMPUTATION, by HARRY.R.LEWS and CHRISTOS. H. PAPADIMITRIOU, Pearson Education, Second Edition.
M.Sc(CS)
INTRODUCTION TO AUTOMATA THEORY, LANGUAGES AND COMPUTATION, by HOPCROFT.J.E AND J.D.ULLMAN, Narosa Publications.
Introduction to automata theory, languages and computation by John. E. Hopcroft, Jeffery D ullman. Narosa Publications.
Introduction to automata theory, languages and computation by John. E. Hopcroft,Rajeev motwani, Jeffery D ullman. Pearson Publications.
Elements of the Theory of Computation by Harry R lewis, Ch. Papadmitriou. Pearson Edition
Theory of Computer Science, by K.L.P. Mishra, N. Chandra sekharan. Prentice hall of India.
An Introduction to Formal Languages and Automata, by Peter Linz. Narosa Publications.
The theory of Computation, by Bernard M Mort, Pearson Edition.
Contact me on suggestme@yahoo.co.in (OR) sun_n660@yahoo.co.in