![Theory of Computation](/img/default-banner.jpg)
- 41
- 740 791
Theory of Computation
เข้าร่วมเมื่อ 18 พ.ค. 2016
วีดีโอ
Introduction to Computational Complexity Theory
มุมมอง 13K7 ปีที่แล้ว
Introduction to Computational Complexity Theory
Decidability properties of Regular and Context Free Languages
มุมมอง 14K7 ปีที่แล้ว
Decidability properties of Regular and Context Free Languages
Non deterministic Turing Machine Edit Lesson
มุมมอง 10K8 ปีที่แล้ว
Non deterministic Turing Machine Edit Lesson
Closure Properties of Decidable and Turing recognizable languages
มุมมอง 15K8 ปีที่แล้ว
Closure Properties of Decidable and Turing recognizable languages
Pushdown Automata - Examples and Relation with CFGs
มุมมอง 10K8 ปีที่แล้ว
Pushdown Automata - Examples and Relation with CFGs
Pushdown Automata - Definition and Example
มุมมอง 10K8 ปีที่แล้ว
Pushdown Automata - Definition and Example
Equivalence of NFA and DFA, Closure properties
มุมมอง 31K8 ปีที่แล้ว
Equivalence of NFA and DFA, Closure properties
.ll
i just hate how my college forces me to watch this from swayam portal removing normal classes and normal exams altogether.
you are lucky
@@atharvchavan544 bro exam dena padta he. Aur padai ke naam pe 8 saal purana video chod rahe he.
The teacher we need, but we don't deserve.
"Deserve"?! This over exaggeration is so cringy.
@@saranshsaini4870 thanks 👍
For the recognizable languages, kleene star will loop infinitely and fail if you run sequentially if done using your method.
this is a very well explained video and this is the quality of lectures every child should receive ... kudos to ur explanation sir!!
for all 'x' belonging to sigma* also mean x can be epsilon, for which |x| = 0. so how is t(0) computed as 't' maps natural number to natural number but 0 is not a natural number.
you are the goat
mmakwana fada
sir i have a doubt in construction of nfa for the star operation, i think we have to also cover the case when string is epsilon, as it is present in the star of two languages.
n> o string form will accepted, not n >= 0 i guess..
t
Hello, sir. You content is great, if you make some thumbnails, edit titles and cover, edit video to speed up some writings, your channel will go to next level.
This lecture was super helpful! Thanks!
Excellent lecture. Watching this playlist at the night before the exam . Thanks a lot
watching this 6th time.
its depressing we have Undecidability. there are problems which my TM can never ever solve :(
awesome
Nice explanation using those boxes to represent. Thank you Sir!
kya padhate ho sir bhooot acchaa
Thank you sir for this informative and well-structured Lecture series.
Definitely, best lectures, some math is missing so that it is graspable to students. I noticed that at 14.09, where e-transitions are taken care, e-closure from q_0, starting state must also be cared. However, I feel that just a small mistake. If you go through Prof. Ullman's lecture, this mistake can be easily rectified.
best playlist of TOC
NPTEL MAKES ME TO FEEL LIKE I AM AN IIT STUDENT😊
This lecture should be re-recorded. too much confusion and nauseating camera work
I am very thankful that even though there are not any good teachers in my college, there are excellent teachers on youtube.
11:37 whoever edited this smooth-ass cut deserves a raise
that opening soundtrack is just like twin peaks opening soundtrack
i m still stucka t reduction i cant understand reductions
🙏
Kitna bekar pdate ho aaap
Thank you sir for explaining myhill nerode theorem so briefly.
doesn't S->SB remove B->^ give S->S production which shall be eliminated as unit production?
did you find any reason?
I love the intro music. very retro vibes. also great video.
Thank you Sir, Love from NIT Kurukshetra. ❤
Thank you! That was a very clear explanation
Very Well Explained. Love from NIT Kurukshetra, MCA Dept. :)
Thanks sir It is easy to understand when you explain
COMPLETE SPPU SYLLABUS INCLUDED ?
I think there should be an update of this course now, by the same professor. BTW this is an awesome course.
Sir at 14:36 it must be 0 on the edge from q1 to q0 as explained by you.
I think at 19:00 there is a little mistake . I think it should be (q0 , q1 , q0 , q0). Please Some Body verify my answer...
You are correct, I got the same answer
ur right bro thnx for pointin it out .
7:02 mins u said Pen and paper is a computational device. Which is a completely false statement. If we write 1+2 on paper it ain't gonna give 3 as output by itself. We are the one who is writing the output 3 on paper after calculating the problem. How can a thing which has no computational power can be a computational device? We use pen and paper to note the current progress of the problem that doesn't mean pen and paper will become a computational device.
Bashar al Asad 😲
Very Well Explained.
nice examples
fun fact: pen and paper is a storage device, our brain is the computing one.
great explanation
that was clear.
great lecture, understood everything, thanks.