Machines | Lecture 24/65: Turing Machine Examples
videos | at work | information | view | construction
"Theory of Computation"; Portland State University: Prof. Harry Porter; www.cs.pdx/~harry
Comments
-
Very well explained. Could you please consider uploading a better quality (HQ or HD) video? Thank you.
-
perfect , it helps me a lot . Thank you
-
Thanks for the helpful video! I didn't realize you were a professor now, Harry Porter, I always figured it would be Hermione. :)
-
Short + concise + good examples = Great lectures!
-
Very helpful video series! For anyone who's looking for the notes used in these videos, I found them at this link: http://web.cecs.pdx.edu/~harry/TheoryOfComp/index.html Good Luck! :D
-
Thank you,so much Sir!! very well explained :D
-
Well explained! Much better than my teacher! Thanks for the video! 😉
-
Looks like a good video, too bad its 240p
-
Thank you, a lot!!!!!!
-
Thank you so much Sir this video and all the others as well are brilliant!
-
Thank you
-
The last diagram has a slight bug. _1 is accepted, as a space at start allows it to reach the accept state.
-
u save my life thank you
-
thank you dr. clear and simple example
-
This machine had one bug and I've fixed it. If you are interested in the complete Java code simulating this machine, you can find it on my Github https://github.com/MyCloud012/Turing-Machine
-
if language is L=01*O, this means,beacuse of 1* (zero, one of multiple times 1) that we can enter 0>nothing<0 and it should accept this input. But if we look at yours diagram, if we put in zero and then blank it would be rejected.
-
Thank you very much sir, I am grateful to you
Atlast i understood how a turing machine works -
The clearst explanation I have ever found! Thank you very much
-
great explanation =D
-
oooh thanks God i tought i will never find someone who`ll give a proper example for this