Introduction of Automata Theory
Sir Abdul Wahab
Topics:
Introduction, Terminology, Definitions
Sets and Operations
Languages
Regular Expressions (R.E.)
Finite Automata (F.A.)
Deterministic Finite Automaton (D.F.A.)
Non Deterministic Finite Automaton (N.D.F.A.)
Language Accepted by Finite Automata
Convert Regular Expression into (N.F.A)
Constructing Regular Expression from Finite Automata
Finite Automata with Epsilon moves
Moore and Mealy machines
Converting between Moore and Mealy machine
Pumping lemma for regular languages
Kleene's Theorem
Regular Grammar
Myhill-Nerode Theorem Minimization of DFA
Context-free Languages
Pushdown Automata
CFG/CFL to PDA
PDA to CFG/CFL
CFG derivation trees Parsing
Chomsky normal form
Greibach normal form
Ambiguous CFL's
TURING MACHINES TM
Computability and Complexity
Sir Abdul Wahab
Topics:
Introduction, Terminology, Definitions
Sets and Operations
Languages
Regular Expressions (R.E.)
Finite Automata (F.A.)
Deterministic Finite Automaton (D.F.A.)
Non Deterministic Finite Automaton (N.D.F.A.)
Language Accepted by Finite Automata
Convert Regular Expression into (N.F.A)
Constructing Regular Expression from Finite Automata
Finite Automata with Epsilon moves
Moore and Mealy machines
Converting between Moore and Mealy machine
Pumping lemma for regular languages
Kleene's Theorem
Regular Grammar
Myhill-Nerode Theorem Minimization of DFA
Context-free Languages
Pushdown Automata
CFG/CFL to PDA
PDA to CFG/CFL
CFG derivation trees Parsing
Chomsky normal form
Greibach normal form
Ambiguous CFL's
TURING MACHINES TM
Computability and Complexity
Unsolvable Problems
Time Complexity
CYK algorithm for CFG's
CFL pumping lemma and properties
Church Turing Thesis
PDF File:
Time Complexity
CYK algorithm for CFG's
CFL pumping lemma and properties
Church Turing Thesis
PDF File:
MSWord File:
Mirror#1 ===> Click Here ===> Download Now