Automata & Regular Languages - Lecture 3

Automata, Computability and Complexity - Lectures is a lesson series of Theory of Computation. This is the hard part of subject for Mathematics and Computer Science student in university. Those lectures are public resources then collected, edited to make student more easier to follow.
.
Course is divided into 2 main parts: Theoretical Computer Science and Computational Complexity.

.
Lecture 2- Finite Automata: https://youtu.be/_l6nqMQC5vg
.

Course material (highly recommend for reading):

1. Introduction to the Theory of Computation by Michael Sipser -- covers most material from the first half of the course
2. Optional: Quantum Computing Since Democritus by Scott Aaronson
3. Optional: The Nature of Computation by Cris Moore and Stephan Mertens
4. Optional: Computational Complexity: A Modern Approach by Sanjeev Arora and Boaz Barak -- covers most material from the second half
5. Automata, Computability and Complexity: Theory and applications by Elaine Rich
.

Like and Subscribe for more course lectures.
Nguồn: http://stellar.mit.edu/