Theory of Computation (CS6160) Lecture 04 (Part 2 of 2), Professor Gabriel Robins @GabrielRobins
Theory of Computation (CS6160) Lecture 04 (Part 2 of 2), Professor Gabriel Robins  @GabrielRobins
Uploaded February 2018 | Updated November 2026, 2 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: decidable properties of context-free langauges and grammars, CFL emptiness / finiteness, parsing, compilers, undecidable properties of context-free langauges and grammars, PDA minimality / equivalence, CFG minimality / ambiguity / equivalence, emptiness of intersection, inherent ambiguity, PDA enhancements, 2-way PDAs, 2-stack PDAs, queue automata, 2-head PDAs, non-deterministic PDAs, non-regular languages, pumping theorem, 0^n1^n, type errors revisited, the set of English words is regular
Theory 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   PanoptoTheory of Computation (CS3102), Lecture 17, Professor Gabriel Robins, Spring 2018Emily and Tony dancing, Nov 6, 2025Adam playing the flute while touring the Saint Minas Villa in Greece, June 2026Theory of Computation (CS3102), Lecture 26, Professor Gabriel Robins, Spring 2018 PanoptoTheory of Computation (CS3102), Lecture 18, Professor Gabriel Robins, Spring 2018Alex and Gabe dancingMackenzie dancing with Sinai and Gabe
Gabriel Robins |

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

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER