Theory of Computation
Theory of Computation

Class 16: Completing DFA=RE Proof

23 March 2023

Slides from class: class16.pdf

Problem Set 6 is due on Monday, 27 March. The latex template is https://www.overleaf.com/read/bfftypdhtryf.

Python’s Regular Expression library code is here: https://github.com/python/cpython/blob/3.11/Lib/re/_parser.py (see lines starting at 634 for the implementation of repetition patterns including the (bogus?) Kleene star).

Cloudflare Outage, July 2, 2019

  • « Previous page: Class 15: Deterministic and Nondeterministic FAs
  • Next page: Class 17: NFA vs. RE »

cs 3120: Theory of Computation
Spring 2023
University of Virginia
Subscribe to the  RSS feed.