Conversion of NFA to DFA Examples (Powerset Construction)

Поделиться
HTML-код
  • Опубликовано: 12 ноя 2024

Комментарии • 11

  • @EasyTheory
    @EasyTheory  4 года назад

    Next video! Showing that minimal NFAs are not unique: ruclips.net/video/Nyzwq4CA3KE/видео.html

  • @berkaysenoglu1784
    @berkaysenoglu1784 9 месяцев назад

    Your videos literally saved my life! Great explanations :)

  • @charrasaxton8472
    @charrasaxton8472 3 года назад +3

    Omg, this video legit saved my life

  • @behrouzmaasser5931
    @behrouzmaasser5931 Год назад +2

    Thanks for the Video, but I think at minute 09:46, the transition should be ({q1, q2, q3}, a) --> {q0, q3, q4, q5} instead. Because we have an epsilon transition from "q2" itself which leads to "q3" directly and allows a "a" transition from "q2" to "q4". Please tell me if I'm mistaking.

  • @samjudelson
    @samjudelson 3 года назад +1

    Very helpful thank you

  • @malekalsibai3788
    @malekalsibai3788 3 месяца назад

    10:53 doesnt q5 go when on a to q2 and q3 ?

  • @fallofmanbrand
    @fallofmanbrand 4 года назад

    cool video I really liked it

  • @mehrshadmohammadi3548
    @mehrshadmohammadi3548 3 года назад

    what if the nfa has more than 1 starting states?

    • @EasyTheory
      @EasyTheory  3 года назад +1

      One way around it is to make a new start state that epsilon-transitions into the set of (former) starting states.