1. Introduction, Finite Automata, Regular Expressions
MIT OpenCourseWare在 YouTube 播放 ↗
档案导读
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 regular languages under union and begins concatenation.
档案英文原文 · 来自 HackerTube 开放档案，暂未收录字幕分析。