NPTEL Video Course : Theory of Computation


Lecture 36 - Example continued. Finiteness of TM description, TM configuration, language acceptance, definition of recursively enumerable (r.e.) languages

1x
Search within video (e.g: "algorithm", "compiler" or "coding theory")

                       

Speech Recogniser Status: Not Recognising


    /
            


    DIGIMAT Learning Management Platform