The equivalence of regular languages is decidable. Here is how.

Checking whether a regular language is empty is decidable. Here is how.

Checking whether a string belongs to a regular language is decidable. Here is how.

What is <M>? A short discussion of encoding machines as strings.

Non deterministic turing machines and their equivalence to single-tape turing machines. Computation tree and address mapping discussed.

Multitape turing machines and their equivalence to single-tape turing machines.

A clear explanation of Turing Recognizable, Decidable and Enumerable languages and the relationships between them.

The concept of configurations of a Turing Machine and how they change based on different transitions. The notion of computation is also discussed.

A worked-out example of a high-level (implementat) description of a Turing Machine to recognize a language.

A worked-out example of a low-level (formal) description of a Turing Machine to recognize a language.