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

แชร์
ฝัง
  • เผยแพร่เมื่อ 23 ธ.ค. 2024

ความคิดเห็น •

  • @philosophyversuslogic
    @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
    @aladdin_4life ปีที่แล้ว +1

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

    • @afflux4534
      @afflux4534 ปีที่แล้ว

      bump

    • @codecleric4972
      @codecleric4972 8 หลายเดือนก่อน +1

      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
    @fatalis0898 ปีที่แล้ว +2

    More of theory of computation.

  • @OK-ri8eu
    @OK-ri8eu ปีที่แล้ว +1

    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
    @IsaAbuhuseina ปีที่แล้ว +2

    Thx

    • @obww306
      @obww306 ปีที่แล้ว

      Uat iz it

  • @flavoredtears3898
    @flavoredtears3898 ปีที่แล้ว

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

    • @Trevtutor
      @Trevtutor  ปีที่แล้ว

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