Theory of Computation
Theory of Computation
  • Видео 41
  • Просмотров 766 295
Rice's theorem
Rice's theorem
Просмотров: 37 712

Видео

Introduction to Computational Complexity Theory
Просмотров 13 тыс.8 лет назад
Introduction to Computational Complexity Theory
More on the class NP
Просмотров 6 тыс.8 лет назад
More on the class NP
NP-Completeness
Просмотров 6 тыс.8 лет назад
NP-Completeness
More on NP-Completeness
Просмотров 5 тыс.8 лет назад
More on NP-Completeness
Undecidability
Просмотров 16 тыс.8 лет назад
Undecidability
Decidability properties of Regular and Context Free Languages
Просмотров 15 тыс.8 лет назад
Decidability properties of Regular and Context Free Languages
More on Undecidability
Просмотров 9 тыс.8 лет назад
More on Undecidability
Reduction
Просмотров 13 тыс.8 лет назад
Reduction
Applications of Reduction
Просмотров 7 тыс.8 лет назад
Applications of Reduction
Turing Machine
Просмотров 15 тыс.8 лет назад
Turing Machine
More on Turing Machine
Просмотров 11 тыс.8 лет назад
More on Turing Machine
Non deterministic Turing Machine Edit Lesson
Просмотров 10 тыс.8 лет назад
Non deterministic Turing Machine Edit Lesson
Configuration Graphs
Просмотров 8 тыс.8 лет назад
Configuration Graphs
Closure Properties of Decidable and Turing recognizable languages
Просмотров 15 тыс.8 лет назад
Closure Properties of Decidable and Turing recognizable languages
Pushdown Automata
Просмотров 11 тыс.8 лет назад
Pushdown Automata
Deterministic Context Free Languages
Просмотров 10 тыс.8 лет назад
Deterministic Context Free Languages
Closure Properties of CFLs
Просмотров 10 тыс.8 лет назад
Closure Properties of CFLs
Pushdown Automata - Examples and Relation with CFGs
Просмотров 11 тыс.8 лет назад
Pushdown Automata - Examples and Relation with CFGs
Pushdown Automata - Definition and Example
Просмотров 10 тыс.8 лет назад
Pushdown Automata - Definition and Example
Examples of non- CFLs
Просмотров 8 тыс.8 лет назад
Examples of non- CFLs
Examples of CFGs, Reg subset of CFL
Просмотров 12 тыс.8 лет назад
Examples of CFGs, Reg subset of CFL
Parse tree, derivation, ambiguity
Просмотров 13 тыс.8 лет назад
Parse tree, derivation, ambiguity
Normal forms, Chomsky normal form
Просмотров 11 тыс.8 лет назад
Normal forms, Chomsky normal form
Non-CFLs, pumping lemma
Просмотров 10 тыс.8 лет назад
Non-CFLs, pumping lemma
Introduction to CFGs
Просмотров 14 тыс.8 лет назад
Introduction to CFGs
DFA minimization
Просмотров 12 тыс.8 лет назад
DFA minimization
Examples of non-regular languages
Просмотров 13 тыс.8 лет назад
Examples of non-regular languages
Equivalence of NFA and DFA, Closure properties
Просмотров 32 тыс.8 лет назад
Equivalence of NFA and DFA, Closure properties
Regular expressions
Просмотров 19 тыс.8 лет назад
Regular expressions

Комментарии

  • @GursimarSinghMiglani
    @GursimarSinghMiglani Месяц назад

    .ll

  • @bpn333
    @bpn333 Месяц назад

    i just hate how my college forces me to watch this from swayam portal removing normal classes and normal exams altogether.

    • @atharvchavan544
      @atharvchavan544 Месяц назад

      you are lucky

    • @bpn333
      @bpn333 Месяц назад

      @@atharvchavan544 bro exam dena padta he. Aur padai ke naam pe 8 saal purana video chod rahe he.

  • @thendimension4816
    @thendimension4816 2 месяца назад

    The teacher we need, but we don't deserve.

  • @oogieboo1
    @oogieboo1 2 месяца назад

    For the recognizable languages, kleene star will loop infinitely and fail if you run sequentially if done using your method.

  • @hara128
    @hara128 3 месяца назад

    this is a very well explained video and this is the quality of lectures every child should receive ... kudos to ur explanation sir!!

  • @Hades-su8sf
    @Hades-su8sf 4 месяца назад

    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.

  • @JakeSilver26
    @JakeSilver26 4 месяца назад

    you are the goat

  • @madalitsomuwawa88
    @madalitsomuwawa88 5 месяцев назад

    mmakwana fada

  • @kira-nr3qj
    @kira-nr3qj 7 месяцев назад

    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.

  • @JacobPeralta21
    @JacobPeralta21 8 месяцев назад

    n> o string form will accepted, not n >= 0 i guess..

  • @ujjwal770
    @ujjwal770 9 месяцев назад

    t

  • @anarabiyev9766
    @anarabiyev9766 9 месяцев назад

    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.

  • @thomaspanyasrivinit5473
    @thomaspanyasrivinit5473 9 месяцев назад

    This lecture was super helpful! Thanks!

  • @NAMANMARKHEDKAR
    @NAMANMARKHEDKAR 9 месяцев назад

    Excellent lecture. Watching this playlist at the night before the exam . Thanks a lot

  • @giveaway4002
    @giveaway4002 10 месяцев назад

    watching this 6th time.

  • @giveaway4002
    @giveaway4002 10 месяцев назад

    its depressing we have Undecidability. there are problems which my TM can never ever solve :(

  • @giveaway4002
    @giveaway4002 10 месяцев назад

    awesome

  • @aishwaryakasthala97
    @aishwaryakasthala97 10 месяцев назад

    Nice explanation using those boxes to represent. Thank you Sir!

  • @AnupGupta-z9x
    @AnupGupta-z9x 11 месяцев назад

    kya padhate ho sir bhooot acchaa

  • @rijulsharma4453
    @rijulsharma4453 Год назад

    Thank you sir for this informative and well-structured Lecture series.

  • @kapilgupta5928
    @kapilgupta5928 Год назад

    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.

  • @itsmevision38
    @itsmevision38 Год назад

    best playlist of TOC

  • @snehalathareddy5566
    @snehalathareddy5566 Год назад

    NPTEL MAKES ME TO FEEL LIKE I AM AN IIT STUDENT😊

  • @sayanghosh6996
    @sayanghosh6996 Год назад

    This lecture should be re-recorded. too much confusion and nauseating camera work

  • @deepakmodi9343
    @deepakmodi9343 Год назад

    I am very thankful that even though there are not any good teachers in my college, there are excellent teachers on youtube.

  • @sayanghosh6996
    @sayanghosh6996 Год назад

    11:37 whoever edited this smooth-ass cut deserves a raise

  • @mauricio0guaruja
    @mauricio0guaruja Год назад

    that opening soundtrack is just like twin peaks opening soundtrack

  • @ikramwani5207
    @ikramwani5207 Год назад

    i m still stucka t reduction i cant understand reductions

    • @saranshsaini4870
      @saranshsaini4870 День назад

      exactly, understood everything except undecidability and reductions

  • @anupkumar-cy2dv
    @anupkumar-cy2dv Год назад

    🙏

  • @dennyage4791
    @dennyage4791 Год назад

    Kitna bekar pdate ho aaap

  • @kunaldubey3152
    @kunaldubey3152 Год назад

    Thank you sir for explaining myhill nerode theorem so briefly.

  • @steveraphaelpulikottil5755
    @steveraphaelpulikottil5755 Год назад

    doesn't S->SB remove B->^ give S->S production which shall be eliminated as unit production?

  • @user-mv3cg7hi7g
    @user-mv3cg7hi7g Год назад

    I love the intro music. very retro vibes. also great video.

  • @deveshparwani9087
    @deveshparwani9087 Год назад

    Thank you Sir, Love from NIT Kurukshetra. ❤

  • @chilliam65
    @chilliam65 Год назад

    Thank you! That was a very clear explanation

  • @devesh096
    @devesh096 Год назад

    Very Well Explained. Love from NIT Kurukshetra, MCA Dept. :)

  • @bijendersverma
    @bijendersverma 2 года назад

    Thanks sir It is easy to understand when you explain

  • @GamingBoiiii
    @GamingBoiiii 2 года назад

    COMPLETE SPPU SYLLABUS INCLUDED ?

  • @varunkumar3361
    @varunkumar3361 2 года назад

    I think there should be an update of this course now, by the same professor. BTW this is an awesome course.

  • @bijendersverma
    @bijendersverma 2 года назад

    Sir at 14:36 it must be 0 on the edge from q1 to q0 as explained by you.

  • @190_priyamsaha7
    @190_priyamsaha7 2 года назад

    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...

  • @deepjyoti7147
    @deepjyoti7147 2 года назад

    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.

  • @djhi-tek9249
    @djhi-tek9249 2 года назад

    Bashar al Asad 😲

  • @rajeshprajapati4863
    @rajeshprajapati4863 2 года назад

    Very Well Explained.

  • @suhaskadu1358
    @suhaskadu1358 2 года назад

    nice examples

  • @jaisuriyar5259
    @jaisuriyar5259 2 года назад

    fun fact: pen and paper is a storage device, our brain is the computing one.

  • @rony2701
    @rony2701 2 года назад

    great explanation

  • @rony2701
    @rony2701 2 года назад

    that was clear.

  • @palashbehra9303
    @palashbehra9303 2 года назад

    great lecture, understood everything, thanks.

  • @-rpm
    @-rpm 2 года назад

    Irony in having a computer science class with writing using a chalk.