1. Introduction, Finite Automata, Regular Expressions

Why it was recommended

Sipser also has corresponding lectures that are available for free on YouTube here

Recommendationsky2224 · Original2024-06

What it covers

The first lecture of Michael Sipser's MIT 18.404J Theory of Computation course, covering course mechanics, finite automata, regular languages and regular expressions. It proves closure of. It is for someone meeting the subject for the first time.

Video details

Channel

MIT OpenCourseWare

Length

1 hr 0 min

Year

2021

More in this topic

• Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich
• 28c3: The Science of Insecurity
• "Propositions as Types" by Philip Wadler
• Break Me00 The MoVfuscator Turning mov into a soul crushing RE nightmare Christopher Domas
• Math's Fundamental Flaw
• On The Turing Completeness of PowerPoint (SIGBOVIK)