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: https://www.youtube.com/channel/UCGYSfZbPp3BiAFs531PBY7g/join Patreon: http://bit.ly/2EUdAl3 Website: http://TrevTutor.com Subscribe: http://bit.ly/1vWiRxW Facebook: http://on.fb.me/1vWwDRc 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