The "General" General NFA Method (NFA to Regex, GNFA)

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

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

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

    Though it was holy moly😂 it was a great video ! clear and awsome !!!

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

    A Codewars challenge brought me here. This is cool stuff, thanks.

  • @LaserAltec
    @LaserAltec Месяц назад

    I'm not sure, just asking... for q1-->q1 didn't you need the extra long way too from D-->A*-->G-->L*-->F and also the other way round ? so all in all for q1-->q1: B + DA*GL*F + EL*HA*C ? Same for all other paths ?

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

    been enjoying your videos, what if the given NFA(with a final state) has one epsilon transition in it. Thank you so much :)