Regular Operators with DFAs | Closure Under Union | Theory of Computation

[@philosophyversuslogic]

Fascinating lessons! May I ask you, please? Do you have videos of lambda calculus or using an operator lambda in Predicate or Propositional logic? Or maybe you're planning to shoot the one? Thanks.

[@aladdin_4life]

11:30 why is q0= (q1, q2) instead of (q0, q2)?

[@afflux4534]

bump

[@codecleric4972]

That's what it should be. It's just a mistake. There are a few mistakes in these videos I noticed and he doesn't seem to address them. They're usually pretty apparent if you're paying attention so just try to be careful when you're following along and you can still get good information and you'll notice when he makes a mistake in his presentation.

[@fatalis0898]

More of theory of computation.

[@flavoredtears3898]

do you have any videos on regular expressions? where questions could look like ((a + b + c)∗)(b + c) ?

[@Trevtutor]

It will come soon in the series. Non-deterministic machines -> regular expressions

[@OK-ri8eu]

Thanks for the video first, now and correct me if I'm wrong, but the state (q1,q3) with a=0 does not seem to be correct. you will end up with two paths (q0,q3) and (q1,q2) which is an NFA not a DFA..

[@IsaAbuhuseina]

Thx

[@obww306]

Uat iz it