Next video! Converting from a Regular grammar to an NFA to a regex: kzbin.info/www/bejne/bITcg6qmrrZ5bKs
@MonsterHunterDignity4 жыл бұрын
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!
@EasyTheory4 жыл бұрын
Ü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)
@MEWOVER90002 жыл бұрын
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!
@Dsalas963 жыл бұрын
ASU CS Student here. Your videos are the best and are helping me get by this class in these hard times
@kseniiafilippova854010 ай бұрын
Thank you !!!
@ProfBeckmann Жыл бұрын
thanks
@irisfang596110 ай бұрын
what a beautiful explanation!
@rasikaraja18402 жыл бұрын
Excellent
@brendawilliams80624 ай бұрын
Can’t be 111:::::/36. So I’m trying this. Thankyou
@brendawilliams80624 ай бұрын
113
@onurrrrr778 ай бұрын
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?
@spicefiend4 жыл бұрын
Thanks for making these videos! Helping me out a lot
@EasyTheory4 жыл бұрын
You're welcome!
@hamed-es3wz3 жыл бұрын
you explain very good
@legend78903 жыл бұрын
Are those two Turing machines the same or different?
@MrNumiss4 жыл бұрын
D-1 and D-2 are other tm?
@EasyTheory4 жыл бұрын
In a sense yes. We are given these two machines, and are building a machine that is the union, etc. of their languages.