Lecture 1 - Finite State Machines (Part 1/9)
Loading...
Top Comments
All Comments (27)
-
Does anyone have a pdf transcript of his lectures?
-
I have been looking for a good course in Compiler Theory for years. This takes me back to learning compiler in college. The professor is very easy to understand and interacts with his class (even the virtual ones). I will be recommending this course!
-
@NoHemlockForMe I have seen proofs done that explicitly show that it is IMPOSSIBLE to determine whether a program will result in an infinite loop. It can be found in the MIT lectures SICP. The problem with detecting conditions that result in exiting each branch is that the number of possible inputs into a program can be virtually infinite. Each sub-branch condition needs to be tested for each potential super-branch condition. Even with minor nesting, the size grows exponentially.
-
He is a knowledgeable professor. His lectutes are tremendously useful. THANK YOU Professor Shai.
-
his hat is cute
-
Sooooo much better than how my professor is teaching this.
-
it would be great if you upload a set of Complexity Theory lectures by the same professor (if there is any)...
-
@NoHemlockForMe dear lord! this is called the "HALTING PROBLEM" and it can't be solved. it is proved over and over again by computer scientists that halting problem is not solvable. If you have invented such an algorithm, you should really send it to IEEE or ACM, or Stanford, MIT, Berkeley etc... and teach those scientists that they know nothing!!! (sarcasm of course!)
you wont become a computer scientist just because you've learned how to write a hello world program in Python or Java!!
-
marvelous..jus go through all the lectures..as interesting as gta
-
@jingoria Email them the link ;)
9:58
Lecture 1 - Finite State Machines (Part 3/9)by Coderisland19,508 views- 9:58
Lecture 1 - Finite State Machines (Part 4/9)by Coderisland14,165 views
- 9:58
Lecture 1 - Finite State Machines (Part 5/9)by Coderisland11,333 views
- 9:58
Lecture 3 - The Pumping Lemma (Part 1/10)by Coderisland24,639 views
- 4:51
Computer Science: Converting NFA to DFAby Mcoroklo17,766 views
- 51:58
Lecture - 8 State Machine Designby nptelhrd37,301 views
- 9:58
Lecture 2 - Closure and Nondeterminism (Part 3/9)by Coderisland5,568 views
- 9:53
Lecture 7 - Pushdown Machines Automata's (Part 9/9)by Coderisland3,227 views
- 9:58
Lecture 2 - Closure and Nondeterminism (Part 5/9)by Coderisland6,379 views
- 8:00
Deterministic Finite Automata Part 3by TheOresoft3,743 views
- 9:59
Lecture 12 - Turing Machines (Part 3/10)by Coderisland5,525 views
- Coderisland238 videos
- 9:58
Lecture 4 - Minimizing Finite State Machines (Part 1/9)by Coderisland7,886 views
- 9:59
Lecture 12 - Turing Machines (Part 2/10)by Coderisland7,233 views
- 9:58
Lecture 3 - The Pumping Lemma (Part 9/10)by Coderisland3,825 views
- 57:17
Lecture 38-Finite State Automatonby nptelhrd52,102 views
- 9:58
Lecture 2 - Closure and Nondeterminism (Part 8/9)by Coderisland3,687 views
- 9:58
Lecture 4 - Minimizing Finite State Machines (Part 4/9)by Coderisland3,565 views
- 9:58
Lecture 1 - Finite State Machines (Part 6/9)by Coderisland11,451 views
- 6:01
Finite State Automata - The Movie, the Rideby MrIon282,350 views
Excellent, a very crisp & clear lecture. I wish we had such professors in our college but unfortunately we have some of the worst professors.
jingoria 1 year ago 32
I wish my lecturer had taught us this way..
Thanks for uploading..
MsLohithaReddy 1 year ago 16