112 тысяч подписчиков
10 видео
Why study theory of computation?
Introduction to Languages, Strings, and Operations
Regular Languages: Deterministic Finite Automaton (DFA)
Regular Languages: Nondeterministic Finite Automaton (NFA)
Regular Operations
What is the Pumping Lemma
Nonregular languages: How to use the Pumping Lemma
The Halting Problem: The Unsolvable Problem
Undecidable Problems: Reducibility (Part 1) | What are Reductions?
Undecidable Problems: Reducibility (Part 2) | A Sample Reduction
