Theory of Computation (CS6160) Lecture 05 (Part 1 of 2), Professor Gabriel Robins @GabrielRobins
Theory of Computation (CS6160) Lecture 05 (Part 1 of 2), Professor Gabriel Robins  @GabrielRobins
Uploaded February 2018 | Updated November 2026, 5 days ago
This lecture is part of a course on the Theory of Computation, by Professor Gabriel Robins at the University of Virginia (CS6160 Spring 2018), with PowerPoint slides at http://www.cs.virginia.edu/~robins/cs6160/ and other related videos at http://www.cs.virginia.edu/robins/videos.html

Specific topics covered in this lecture: review of pushdown automata / non-determinism / closure properties of CFLs / decidable properties of CFLs & CFGs / PDA enhancements. pumping revisited, cube-free and square-free strings, complementation revisited, "the truth - the whole truth - and nothing but the truth", Library of Babel
Theory of Computation (CS6160) Lecture 05 (Part 1 of 2), Professor Gabriel RobinsTheory of Computation (CS6160) Lecture 10 (Part 2 of 2), Professor Gabriel RobinsAlgorithms Lecture 22, Nov 12, 2019Laura dancing 3-way with Sinai and Gabe, June 2026Theory of Computation (CS3102), Lecture 28, Professor Gabriel Robins, Spring 2018 PanoptoEdwin and Gabe dancing Argentine Tango, July 26, 2026Theory of Computation (CS6160) Lecture 07 (Part 2 of 2), Professor Gabriel RobinsTheory of Computation (CS6160) Lecture 04 (Part 2 of 2), Professor Gabriel RobinsAnna & Cristian dancing Tango (Vals), May 2025Algorithms Lecture 15, Oct 17, 2019Algorithms   Lecture 14, Oct 15, 2019Algorithms Lecture 24, Nov 19, 2019   Panopto
Gabriel Robins |

Theory of Computation (CS6160) Lecture 05 (Part 1 of 2), Professor Gabriel Robins

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER