We solve three problems of the Post Correspondence Problem, as found in Michael Sipser's "Introduction to the Theory of Computation".

Advertisements

We solve three problems of the Post Correspondence Problem, as found in Michael Sipser's "Introduction to the Theory of Computation".

Advertisements

A proof of the closeness of the Regular Languages operations of Union, Concatenation, Star.

Solutions to some basic Turing Machine problems.

Various variants of the Turing Machine. This is a quick reference of the most popular ones.