Theory of Computation - Lecture Videos
Various techniques for construction of TMs
Equivalence of one tape and multi-tape Turing machines
A language that is not Recursively Enumerable (RE)
An undecidable problem that is RE
Undecidable problems about Turing Machine
Turing Machine Encoding, Universal Language
Rice theorem for Recursive and Recursively enumerable languages
Post’s Correspondence Problem
Matrix grammar
Programmed grammar
Regular Control grammar
Random context grammar
Lindenmayer systems
DNA computing
Membrane computing