Theory of Computation: Conversion of PDA to CFG

Theory of Computation: Turing Machine to MPCP Conversion

Theory of Computation: MPCP to PCP Conversion

Theory of Computation: Modified Post Correspondence Problem (MPCP)

Theory of Computation: Post’s Correspondence Problem (PCP)

Theory of Computation: Code for Turing Machine

Theory of Computation: Undecidability - Introduction

Theory of Computation: Turing Machine Problem - Substring

Theory of Computation: Turing Machine Problem - Palindrome

Theory of Computation: Turing Machine Problem - Concatenation

Theory of Computation: Turing Machine Introduction

Theory of Computation: Pumping Lemma for CFL - Example3 (0^2^i)

Theory of Computation: Pumping Lemma for CFL - Example2 (a^k b^j c^k d^j)

Theory of Computation: Pumping Lemma for CFL with Example (a^n b^n c^n)

Theory of Computation: Conversion of PDA to CFG

Theory of Computation: Conversion of CFG to PDA

Theory of Computation: DPDA Example (wcw^r)

Theory of Computation: NPDA Example (w w^r)

Theory of Computation: PDA Example (a^n b^m c^m d^n)

Theory of Computation: PDA Example (a^n b^m c^n)

Theory of Computation: PDA Example (a^n b^2n)

Theory of Computation: PDA Introduction with Example (0^n 1^n)

Theory of Computation: GNF Example

Theory of Computation: Greibach Normal Form (GNF) with example

Theory of Computation: Ambiguous Grammar - Example