Theory of Automata and Formal Languages

Myhill–Nerode Theorem

Basics of Grammar Part 1

Basics of Grammar Part 2

Derivation tree and Ambiguous grammar part 1

Derivation tree and Ambiguous Grammar part 2

Right Linear and Left Linear Grammar

Simplification of Grammar

Chomsky Normal Form Part 1

Chomsky Normal Form Part 2

Greibach normal Form part 1

Greibach Normal Form Part 2

Practice question of GNF

CYK algorithm

Decision Algorithm of Context Free language

Closure Properties of CFL

Introduction of PDA

Practice questions of PDA part 1

Practice questions of PDA part 2

Non Deterministic Push Down Automata

Conversion of PDA from final state to null store and vice versa

CFG to PDA Conversion

PDA to CFG conversion part 1

PDA to CFG conversion part 2 and 2 stack PDA

Introduction of Turing Machine

Turing Machine as Computer of Integer Functions part 1

Turing Machine as Computer of integer Functions part 2

Turing Machine as Computer of Integer Functions part 3

Variants of Turing Machine, Universal Turing machine, Church Thesis and Linear Bounded Automata

Variants of Turing Machine, Universal Turing machine, Church Thesis and Linear Bounded Automata

Page updated

Google Sites

Report abuse