Lecture 1 - Finite State Machines (Part 9/9)

Поділитися
Вставка

КОМЕНТАРІ • 10

  • @KTYewTube
    @KTYewTube 13 років тому +4

    This is a great prof. I like how he responds to each question with a good attitude, thus encouraging more participation from the class. A lot of professors don't do this and can make the students feel dumb for asking questions. The question earlier by one of the students helped me to get a point where I was confused.

  • @abocidejofa9686
    @abocidejofa9686 11 років тому +3

    This guy is my professor for cs 181 now(ucla). I won't even attend the rest of the lectures. Why waste my gas to drive to school and listen to someone that can't explain anything. I'll rather stay home, watch this guy and read the book. I wish there was a Hollywood hall of fame for university professors. This guy would have the first star. He is simply the best!!!

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

      Isn't it funny how these 'prestigious' schools tend to have professors who can't teach for shit?

  • @cajogos
    @cajogos 12 років тому

    Thanks for these, currently doing FSM in my degree and wanted to understand a bit more about them, these really helped.

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

    Great lecture!!!!.If he could have explain the transition from NFA to DFA using transition table then it would be much simpler to understand.

  • @416939
    @416939 12 років тому +1

    Awesome, thank you very much! All my collegues at Uni watch these, they are really helpfull !! "D

  • @nowzarifarhad
    @nowzarifarhad 11 років тому

    thanks a lot. he explains details very nice.
    Does he have any Lectures about 'Design Compilers' course?

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

    (0^n 1^n) cannot be accepted by both finite and infinite machines?

  • @MohaSharpeyes
    @MohaSharpeyes 13 років тому

    Really really great lecture thank you so much

  • @amansharma-gg2wk
    @amansharma-gg2wk 10 років тому +1

    thanks a lot