NFA to Regex Conversion Example #2, "More Complicated" (GNFA Method)

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

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

  • @Dhiren_
    @Dhiren_ Год назад +3

    You are an absolute legend, makes so much more sense than reading my lecture notes. Thank you.

  • @johann_reimann_2077
    @johann_reimann_2077 4 года назад +4

    Thank you!

  • @vimalathithand917
    @vimalathithand917 Год назад

    Cool video! An absolute Masterpiece!

  • @elijahbrady950
    @elijahbrady950 Год назад

    This problem is literally a problem on my homework. Thank you

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

    your videos are amazing

  • @ghazalasaleem4250
    @ghazalasaleem4250 Год назад

    thanks man. you are really amazing

  • @okaudi
    @okaudi 2 года назад +1

    So , self loop does not count as one in and one out?

  • @explosiongalaxy7334
    @explosiongalaxy7334 2 года назад +1

    what if the start state is also the accept state

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

    I find out your answer is not correct because epsilon isn’t accept in your answer. 6:37 R1 misses a Union between epsilon and ((b U c)(a U b)).

    • @mohammedrakib3736
      @mohammedrakib3736 9 месяцев назад +3

      Anything multiplied by epsilon is itself. So, R.ε = R. So, his answer is correct

  • @ErickIsGaming
    @ErickIsGaming Год назад

    Amazing

  • @TheAmazingLife19
    @TheAmazingLife19 4 месяца назад

    🐐🐐🐐

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

    Thank you!