Converting Non-Deterministic Finite Automata to Deterministic Finite Automata

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

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

  • @khalilchermiti6200
    @khalilchermiti6200 Месяц назад +1

    instant like. Thanks for the explanation sir

  • @octavalexandru1830
    @octavalexandru1830 3 месяца назад +1

    aweosme video! however, i would like to see the epsilon transition being tackled

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

    Thanks so much this helped me a lot... Such clear explanations!

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

    Learned a lot. Thanks!

  • @user-lx8mg5oj8e
    @user-lx8mg5oj8e Год назад +1

    I am a student from China who has watched many videos until I found this one. It has helped me a lot… By the way, I was wondering if I could re-upload this video to Bilibili, which is the Chinese version of RUclips. I will declare where the video is from and hope it can help more students.

    • @Intermation
      @Intermation  Год назад +1

      Thank you so much for your kind words. I am so glad that the videos have helped you with your studies. As for uploading to Bilibili, I will look into it. Please do not upload my videos anywhere. Thanks!

    • @user-lx8mg5oj8e
      @user-lx8mg5oj8e Год назад

      ​@@Intermation alright, I will respect your choice :) , Thanks for your awesome video

  • @y031962
    @y031962 Год назад +1

    thanks so much for the clip; one question remains what is the final state where the output is 1 when condition is met. For example if {q0,q1} state is final; HTH will set the output to '1' and that is not what we want to see.

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

    p͎r͎o͎m͎o͎s͎m͎