Automata Theory | Conversion of NFA to DFA using LAZY EVALUATION Method| Example 1 | ATCD-21CS51

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

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

  • @Jeevan100-n6
    @Jeevan100-n6 19 дней назад +1

    Really bro awesome 😎❤

  • @niteesh9335
    @niteesh9335 19 дней назад +2

    Nice❤

  • @prasadpatil6911
    @prasadpatil6911 18 дней назад +1

    3:30 You have to define q1 and q2 also in the dfa transition table from the nfa transition table then you'll get not only a,b,c then you'll get d,e,f too

    • @thequeenofaj3020
      @thequeenofaj3020 17 дней назад

      i dont think this is necessary, havent seen it being done in other videos either

  • @pratibhajadhav5955
    @pratibhajadhav5955 19 дней назад +1

    Thank you sir

  • @mohammedirfan3365
    @mohammedirfan3365 17 дней назад