Sign up to save your podcasts
Or
Share Theory of Computation - Fall 2011
Share to email
Share to Facebook
Share to X
Share to email
Share to Facebook
Share to X
Or
Theory of Computation - Fall 2011
By Dan Gusfield
Theory of Computation - Fall 2011 episodes
- L8: Introduction to Turing Machines and ComputationsTuring Machines and computations. Recognizable and decidable languages. Examples of designing Turing machines to recognize or decide particular languages.1 hr 15 min
- L7: Contex-Free Grammars and Push-Down AutomataReview of CFLs and grammars; overview of basic results of CFLs without proofs. Introduction to push-down automata (PDA). Statement of the equivalence of CFLs and DPAs.1 hr 19 min
- L6: The Pumping Lemma, and introduction to CFLsA formal treatment of the pumping lemma for regular languages, and its use in proving that certain languages are not regular. Introduction to context free languages and grammars.1 hr 17 min
- L5: Regular expressions, regular languages, and non-regular languagesCompletion of equivalence of regular languages and regular expressions. Introduction to the proof that there are languages that are not regular; first an ad hoc proof using the essence of the pumping lemma, but without formally stating it.1 hr 18 min
- L4: Regular ExpressionsIntroduction to Regular Expressions: Formal recursive definition of a regular expression; composition rules for regular expressions; operators on regular expressions; start of proof of the equivalence of regular expressions and regular languages.1 hr 19 min
- L2: Regular Languages and non-deterministic FSMsOperations on regular languages, union and concatenation. Introductionto non-deterministic finite state machines.1 hr 21 min
- L1: Introduction to Finite-state Machines, Regular LanguagesThis introduction covers deterministic finite-state machines and regular languages.1 hr 7 min
About Theory of Computation - Fall 2011
From the publisher's feed
This is a rigorous undergraduate course on the Theory of Computation, using the classic text "Introduction to the Theory of Computation" by Michael Sipser. The course covers machine models and languages defined by Finite State Machines, Context-Free Languages, and Turing Machines.
There are four major theorems (and their uses) that we will study during this course, providing complete proofs: the pumping Lemma for regular languages, used to show that there are languages that are not regular; the existence of a Universal Turing Machine; undecidability of the Halting problem; and Cook's theorem that NP-complete problems exist. In addition to these major results, and other results, a central goal of the course is to increase student's skill level in understanding and writing rigorous mathematical proofs.