Easy Theory

Real Professor's College Grades 👀

Context-Free Grammar Definitions: Yields, Ambiguous, Leftmost Derivation

An Update

Context-Free Grammar (CFG) Example: Empty Set

Pushdown Automaton to Context-Free Grammar Conversion Example

wish me luck

Post Correspondence Problem (PCP) is Undecidable Proof

Conversion of NFA to Regex PROOF (GNFA Method)

What is a Regular Grammar? NFA to Regular Grammar conversion also!

Context-Free Grammars (CFG) and Context-Free Languages (CFL) - what are they?

Pumping Lemma for Regular Languages Example: Perfect Squares

An Inherently Ambiguous Context-Free Language

I proved a math conjecture

The REAL Reason why Math/Humanities aren't "Useless"

Context-Free Grammar (CFG) Example: {a^i b^j c^k : i at most j+k}

I got a scorpion bite before my Ph.D. Defense 🦂

Let's Solve This Research Problem Together.

10 Reasons NO ONE Should Get a Ph.D.

A nice problem and proof about languages

Why This All Matters

The Most Amazing Exam Cheating Story

a student tried to bribe me once

Closure Properties of Context-Free Languages

Easy Theory Doesn't Support Academic Integrity Violations...Again

My Problem with Pushdown Automata and Turing Machines

The Top Reason Why I'm a Professor

Context-Free Languagess are Closed Under Intersection with Regular Languages

Regular Expression (Regex) to NFA Conversion

Context-Free Grammar (CFG) Example: Non-Palindromes

Post Correspondence Problem over Binary Alphabets is Undecidable

Deterministic Finite Automata (DFA) Examples: Sigma*, Empty Set, and More

Ogden's Lemma for Context-Free Languages Proof

How big is the CFG from the PDA to CFG conversion?

Context-Free Languages in 3.5 Hours (CFG, PDA, Conversions, Closure, Pumping Lemma)

The CYK Algorithm (Problem Set #9)

Multi-Tape Turing Machines

Pumping Lemma for Regular Languages Example: 0ⁿ1ᵐ, n != m (HARD!)

Context-Free Grammar (CFG) Example: Nested Pairs

This AI Does Your Computer Science Homework...kinda

Context-Free Grammar (CFG) Example: Equal Pairs

This CompSci Video was 100% written by ChatGPT

Strong Rice's Theorem

Regex to NFA Conversion Isn't Hard! (Sipser 1.28a)

Simple Simplifications to PDAs (Force the Stack Empty!)

Pumping Lemma for Regular Languages Example: 0^n 1^m (n is less than 3m)

Context-Free Grammar (CFG) Example: Union/Concat/Star

What is Complexity Theory?

Regular Expression Examples

NFA to Regex Conversion Example #2, "More Complicated" (GNFA Method)

DFA Minimization Algorithm + Example

why I haven't made videos recently