Equivalence for DFAs is Decidable (3 different proofs!)

Поділитися
Вставка
  • Опубліковано 21 гру 2024

КОМЕНТАРІ • 8

  • @yanyingzhang1973
    @yanyingzhang1973 2 роки тому +1

    Thank you so much!! It's much clear for me now. I have a question though: isn't it be (L(D1)∩(~L(D2)) ∩ (L(D2)∩(~L(D1)) in about 4:55?(You used ∪ in the middle but shouldn't it be ∩?)

  • @nikolaradakovic5050
    @nikolaradakovic5050 4 роки тому +1

    Prof. do you recommend any good book with step by step proof explanation ?

    • @EasyTheory
      @EasyTheory  4 роки тому +1

      None is "perfect", but I would recommend Sipser's Intro Theory of Computation textbook (since that is what I go off of).

    • @nikolaradakovic5050
      @nikolaradakovic5050 4 роки тому

      @@EasyTheory thanks !

  • @masumazahra5285
    @masumazahra5285 3 роки тому +1

    This was a bit confusing