Solutions for some important automata questions

Thanks to Arun A K  http://www.arun-ak.co.nr/

Automata is easy to study.

Here are the powerpoint presentations of Automata.Download it and study.Its very very simple and easy to understand.
Lectures 

Part 1
Introduction and Languages
Mathematical Preliminaries
Regular Languages and Finite Automata
Nondeterministic Finite Automata
Properties of Regular Languages
Regular Expressions and Elementary Questions for Regular Languages
Pumping Lemma for Regular Languages
More Pumping Lemma Examples
Part 2
Context-Free Languages and Context-Free Grammars
Simplifications of Context-Free Grammars and Normal Forms
Pushdown Automata
Pushdown Automata, Context Free Languages, and Deterministic Pushdown Automata:
Pumping Lemma for Context-Free Languages
More Pumping Lemma Examples
Part 3
Turing Machines
Turing Thesis and Variations of Turing Machines
Universal Turing Machines
Recursive and Recursively Enumerable Languages
Chomsky Hierarchy and Decidability
Decidability
The Post-Correspondence Problem
Time Complexity
NP-Completeness

or
Download directly from this site if u have any problem:
http://www.cs.rpi.edu/%7Edrinep/modcomp/