Automata Theory Tutorial

• Moore & Mealy Machines
• DFA Minimization
• NDFA to DFA Conversion
• Non-deterministic Finite Automaton
• Deterministic Finite Automaton
• Automata Theory Introduction
• Automata Theory - Home

Classification of Grammars

• Chomsky Grammar Classification
• Language Generated by Grammars
• Introduction to Grammars

Regular Grammar

• DFA Complement
• Pumping Lemma for Regular Grammar
• Constructing FA from RE
• Regular Sets
• Regular Expressions

Context-Free Grammars

• Pumping Lemma for CFG
• Greibach Normal Form
• Chomsky Normal Form
• CFG Simplification
• CFL Closure Properties
• Ambiguity in Grammar
• Context-Free Grammar Introduction

Pushdown Automata

• PDA & Parsing
• PDA & Context Free Grammar
• Pushdown Automata Acceptance
• Pushdown Automata Introduction

Turing Machine

• Linear Bounded Automata
• Semi-Infinite Tape Turing Machine
• Non-Deterministic Turing Machine
• Multi-Track Turing Machine
• Multi-tape Turing Machine
• Accepted & Decided Language
• Turing Machine Introduction

Decidability

• Post Correspondence Problem
• Rice Theorem
• Turing Machine Halting Problem
• Undecidable Language
• Language Decidability

Automata Theory Useful Resources

• Automata Theory - Discussion
• Automata Theory - Useful Resources
• Automata Theory - Quick Guide

Selected Reading

• Who is Who
• Computer Glossary
• HR Interview Questions
• Effective Resume Writing
• Questions and Answers
• UPSC IAS Exams Notes