Closure Properties of Decidable Languages

  Рет қаралды 9,464

Easy Theory

Easy Theory

Күн бұрын

Пікірлер: 21
@EasyTheory
@EasyTheory 4 жыл бұрын
Next video! Converting from a Regular grammar to an NFA to a regex: kzbin.info/www/bejne/bITcg6qmrrZ5bKs
@MonsterHunterDignity
@MonsterHunterDignity 4 жыл бұрын
Thank you so much for producing all this great content during this pandemic! It is very difficult to find good content about the theory of CS as it is taught at most universities. Please don't stop making these videos!
@EasyTheory
@EasyTheory 4 жыл бұрын
Übermensch you're welcome! I love making them, and contributing to the study of students everywhere. One video a day and not stopping any time soon (lecture each week day, livestream "office hours" on weekends, 2PM GMT for everything)
@MEWOVER9000
@MEWOVER9000 2 жыл бұрын
University of Toledo student. Thank you so much, I was very behind in this class but between your and Lydia's videos I was able to catch up at a rapid pace and start crushing the homeworks. Cheers!
@Dsalas96
@Dsalas96 3 жыл бұрын
ASU CS Student here. Your videos are the best and are helping me get by this class in these hard times
@kseniiafilippova8540
@kseniiafilippova8540 10 ай бұрын
Thank you !!!
@ProfBeckmann
@ProfBeckmann Жыл бұрын
thanks
@irisfang5961
@irisfang5961 10 ай бұрын
what a beautiful explanation!
@rasikaraja1840
@rasikaraja1840 2 жыл бұрын
Excellent
@brendawilliams8062
@brendawilliams8062 4 ай бұрын
Can’t be 111:::::/36. So I’m trying this. Thankyou
@brendawilliams8062
@brendawilliams8062 4 ай бұрын
113
@onurrrrr77
@onurrrrr77 8 ай бұрын
For intersection, can't we just apply the same strategy with union and say if both accept then accept and reject otherwise? Or am I missing something?
@spicefiend
@spicefiend 4 жыл бұрын
Thanks for making these videos! Helping me out a lot
@EasyTheory
@EasyTheory 4 жыл бұрын
You're welcome!
@hamed-es3wz
@hamed-es3wz 3 жыл бұрын
you explain very good
@legend7890
@legend7890 3 жыл бұрын
Are those two Turing machines the same or different?
@MrNumiss
@MrNumiss 4 жыл бұрын
D-1 and D-2 are other tm?
@EasyTheory
@EasyTheory 4 жыл бұрын
In a sense yes. We are given these two machines, and are building a machine that is the union, etc. of their languages.
@MrNumiss
@MrNumiss 4 жыл бұрын
@@EasyTheory thanks!
@kshitizasthana4462
@kshitizasthana4462 3 жыл бұрын
Great.
@Fahodinho
@Fahodinho 3 жыл бұрын
i love you no homo
Decidable Languages NOT Closed Under Homomorphism
9:05
Easy Theory
Рет қаралды 1,5 М.
Pumping Lemma for Context-Free Languages: Four Examples
48:49
Easy Theory
Рет қаралды 59 М.
It works #beatbox #tiktok
00:34
BeatboxJCOP
Рет қаралды 41 МЛН
It’s all not real
00:15
V.A. show / Магика
Рет қаралды 20 МЛН
Support each other🤝
00:31
ISSEI / いっせい
Рет қаралды 81 МЛН
Why is the Halting Problem Undecidable?
9:38
Easy Theory
Рет қаралды 14 М.
Decidability and Undecidability
7:42
Neso Academy
Рет қаралды 523 М.
Closure Properties of Context-Free Languages
14:08
Easy Theory
Рет қаралды 24 М.
one year of studying (it was a mistake)
12:51
Jeffrey Codes
Рет қаралды 270 М.
Undecidable Languages NOT Closed Under Concatenation
11:53
Easy Theory
Рет қаралды 1 М.
5. CF Pumping Lemma, Turing Machines
1:13:59
MIT OpenCourseWare
Рет қаралды 63 М.
What P vs NP is actually about
17:58
Polylog
Рет қаралды 147 М.
How a Russian student invented a faster multiplication method
18:48
It works #beatbox #tiktok
00:34
BeatboxJCOP
Рет қаралды 41 МЛН