Deterministic Finite State Machines - Theory of Computation

We introduce deterministic finite state machines / deterministic finite state automata, how to define them, and how to take a picture and convert it to the formal representation. We also talk about languages that machines accept. Theory of Computation

0:00 - [Intro]
1:32 - [State Transition Table]
3:07 - [Formal Definition of a DFA]
5:15 - [Example 1]
9:48 - [Example 2]
12:07 - [Example 3]
14:01 - [Languages that Machines Accept]

#FiniteStateMachine #DFAs #FormalLanguages

Join this channel to get access to perks:

Hello, welcome to TheTrevTutor. I'm here to help you learn your college courses in an easy, efficient manner. If you like what you see, feel free to subscribe and follow me for updates. If you have any questions, leave them below. I try to answer as many questions as possible.

Special Thanks to the following incredible supporters for supporting the channel and making these videos possible!
- Nikita Tsyganov

[AryaBaskara]

I was hoping you already had a complete series for this one, but okay. I love your videos, they helped me a lot!

[supraender]

At 9:30, you say that the FSM must end in a 1, but a 0 from q1 would result in q2, which looks like an acceptable end state. Is this an error or am I reading it incorrectly? Thanks for all your videos, you're helping me out a ton with my DM course!

[sharonlu]

Already donated via PayPal. Such a great channel!

[philosophyversuslogic]

This is extremely amazing! I do love your channel, and especially these series! Thank you so much!

[Whey]

Thank you very much for your coverage! I understand the subject a lot better now :D

[husseinmatar]

no intention to continue the series? you are great!

[davidsantos]

at 13:55 you say that the machine will take 0 and accept but wouldn’t that be a odd number of zeros so we would be at q1?

[sharonlu]

Omg so much better when it’s typed down than written on

[robphin]

In the last exercise, how are 1001 and 1000 valid answers?