Finite Automata
and
Regular Languages |
Introduction
Introduction to Finite Automata
NFA – Conversion To DFA
ε-NFA & Conversion to DFA
Complete DFA
DFA Minmization
Finite Automata Union
FA Intersection – Product Automata
Finite Automata Complement
Regular Expression & RE to FA
Finite Automata to Regular Expressions
Pumping Lemma
Closure Properties
Regular Grammars
Finite Automata with Output
2DFA
Automata with Non Reachable States
FA – Useful Techniques
GATE Problems |
Context Free Languages |
Context Free Grammars
Ambiguous Grammars
Removing Epsilon, Unit, Uselss Productions
Normal Forms
Push Down Automata
NPDA
NPDA part2
Final State Vs Empty Stack PDA
CFG to PDA Conversion
PDA to CFG Conversion
Closure properties of CFLs
CYK Algorithm
CFL – Previous GATE Problems
CFL – GATE Problems -Part2 |
Turing Machine |
Introduction to Turing Machine
Writing Turing Machine
Recursive and Recursively enumerable languages
Variations of Turing machine
Counting Languages
Decidability
Decidability part 2
Decidability part 3
Decidability part 4
Decidability part 5
Reductions
Properties of R.E sets
Enumerators
Rice theorem
Grammars and Decidability
GATE Questions |