Тёмный
lydia
lydia
lydia
Подписаться
I make videos about computer science sometimes!
Undecidable Problems: Reducibility (Part 1) | What are Reductions?
4:42
Undecidable Problems: Reducibility (Part 1) | What are Reductions?
3 года назад
Nonregular languages: How to use the Pumping Lemma
4:56
Nonregular languages: How to use the Pumping Lemma
3 года назад
What is the Pumping Lemma
5:11
What is the Pumping Lemma
3 года назад
Regular Operations
5:25
Regular Operations
3 года назад
The Halting Problem: The Unsolvable Problem
4:14
The Halting Problem: The Unsolvable Problem
4 года назад
Regular Languages: Nondeterministic Finite Automaton (NFA)
6:37
Regular Languages: Nondeterministic Finite Automaton (NFA)
4 года назад
Regular Languages: Deterministic Finite Automaton (DFA)
6:28
Regular Languages: Deterministic Finite Automaton (DFA)
4 года назад
Introduction to Languages, Strings, and Operations
5:44
Introduction to Languages, Strings, and Operations
4 года назад
Why study theory of computation?
3:25
Why study theory of computation?
4 года назад
Комментарии