Regular Languages: Deterministic Finite Automaton (DFA)

The finite state machine (also known as finite automaton) is the simplest computational model. This video covers the basics of finite state machines, and provides an introduction to deterministic finite automata (DFAs) and regular languages.

_____________________
Additional resources:

- My previous video on languages. I recommend watching it before this video.

Michael Sipser. 2006. Introduction to the Theory of Computation (2nd. ed.). International Thomson Publishing.
- The main source of my Theory of Computation knowledge (a textbook). Read Chapter 1.1: Finite Automata to learn more about regular languages and DFAs.
_____________________

Again, this video project could not have been done without the support and guidance of Audrey St. John at Mount Holyoke College, a truly incredible professor-mentor-human.

[andrempmorais]

I learned in 6 minutes what they were trying to teach me in a 2 hours class in college, thank you!

[hrmnish]

your voice is so calming, it makes me want to learn more. Very well-paced video. Thanks a lot this channel definitely deserves more viewers.

[cyrusdavidpastelero]

You deserve more views and subscribers! Thank you!

There is a mistake at 4:55, when q1 is false or 0, it must go back to q0.

[lokeshnn]

I feel that knowing "where" something is used, matters a lot when learning. None of my teachers told me "where" FA is used. Great video and thanks for letting me know!

[deckarep]

This was a fantastic overview and beautifully presented!

[Shelly-kxwz]

Now this video is criminally underrated.
I never used to attend the classes in my university as I would find it so boring as my pprofessor would go on and on. But you caught my attention. And Thank you for that.

[siddharthlaiju]

Can easily learn topics by spending much less time, thank you for this. You deserve to be paid better than most of the university professors. PLEASE KEEP IT COMING ABEG.

[GoatMen]

Finally someone made this video in clear English!

[cfjqtdv]

Thank you for this familiar and cute video, it helps me a lot on my computer science course. Thanks again.

[HasanZobaer]

This is the best video I've watched on Regular Languages and Deterministic Finite Automata DFA. I don't usually comment but this video is goood! I am honestly out of words but wanted to leave a comment mentioning that. Been studying these for an entire course but was having so much trouble understanding in class. This video explained it better than 10 lecture classes no cap

[billy-cgqq]

This girl dropped the most amazing video series on Computation Theory and then disappeared! Respect to this amazing girl!!

[theprostratior]

Thanks for keeping this thing short and crispy 👍🏻
Please keep doing this

[mikemalachy]

Extremely concise & clear for anyone to understand.

[harrisonakunne]

This video describes the topic with much clarity, definitely deserves a lot more credit.

[cherryberry]

better than an entire semesters worth of lectures!!! God bless <3

[VahiMangai]

Wow alright. This is as adorable as it is informative. Thank you kindly for your work and skill.

[mustapharaimilawal]

Wow, your video just simplified a very complicated subject, nobody has ever made DFA so understandable, please do more. Thanks a lot.

[zackcarl]

It's the best 6min revision ever, if you already studied toc this is extremely helpful

[bobbrysonn]

You made it easy to grasp the idea of dfa. Thank you.

[dorissorana]

This was so good, your voice is so soothing, forgot I was studying