Все публикации

0:23:31

Theory of Computation: Turing Machine to MPCP Conversion

0:04:46

Theory of Computation: MPCP to PCP Conversion

0:02:23

Theory of Computation: Modified Post Correspondence Problem (MPCP)

0:09:49

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

0:08:04

Theory of Computation: Code for Turing Machine

0:03:42

Theory of Computation: Undecidability - Introduction

0:11:58

Theory of Computation: Turing Machine Problem - Substring

0:22:58

Theory of Computation: Turing Machine Problem - Palindrome

0:09:28

Theory of Computation: Turing Machine Problem - Concatenation

0:23:47

Theory of Computation: Turing Machine Introduction

0:05:42

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

0:04:04

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

0:09:35

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

0:22:36

Theory of Computation: Conversion of PDA to CFG

0:18:21

Theory of Computation: Conversion of CFG to PDA

0:06:36

Theory of Computation: DPDA Example (wcw^r)

0:22:16

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

0:08:42

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

0:05:46

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

0:07:52

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

0:26:55

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

0:08:09

Theory of Computation: GNF Example

0:18:43

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

0:04:27

Theory of Computation: Ambiguous Grammar - Example