Lecture 22/65: Equivalence of CFGs and PDAs (part 2)

Поділитися
Вставка
  • Опубліковано 3 січ 2025

КОМЕНТАРІ • 8

  • @TheSlateOnline
    @TheSlateOnline 8 років тому +3

    You present these topics with more clarity than anyone else on UA-cam. Thanks!

  • @erichoward8249
    @erichoward8249 8 років тому +1

    Great break down of a more complicated process as always !

  • @liyangwang2674
    @liyangwang2674 7 років тому +6

    Nice videos!
    But I surely hope you could improve the qualities, they are kinda blurred.

  • @haris-spam6999
    @haris-spam6999 4 роки тому +1

    Buckle your seatbelts ,really love it.

  • @davidtaylor8144
    @davidtaylor8144 9 років тому +2

    Thanks prof.

  • @Deksudo
    @Deksudo 2 роки тому

    I was following the playlist very closely and loved it so far but it seems like some parts of the formality surrounding pushdown automata got skipped? Like the new definition of the delta function, it wasn't mentioned in the previous videos.

    • @jazracherif
      @jazracherif 5 місяців тому

      The Sipser book “intro to theory of computation” has all the formal definitions and proofs, the prof heavily draws from it

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

    Thanks! Perfect Explanation