Mastering Deterministic Finite Automata: A Formal Approach to Computation Theory

Deepen your understanding of deterministic finite automata with this comprehensive guide. Perfect for students and enthusiasts eager to grasp the fundamentals of computation theory. Support the channel on Patreon! πŸ€–

Mastering Deterministic Finite Automata: A Formal Approach to Computation Theory
Ryan Schachte
1.1K views β€’ Feb 26, 2016
Mastering Deterministic Finite Automata: A Formal Approach to Computation Theory

About this video

Please support me on Patreon: https://www.patreon.com/thesimpleengineer
https://twitter.com/thesimpengineer https://www.linkedin.com/in/schachte/
https://ryan-schachte.com

Don't forget to subscribe! ➨ Website -
➨ New Video! - https://youtu.be/CcxbHkqzJuI
➨ https://www.facebook.com/The-Simple-Engineer-809577752710435/
➨ Github - https://github.com/schachte
---------------------------------------------------------------
In this video, I talk about the components of a DFA and the mathematical notation that is associated with the different parts required for a DFA and the regular languages that they describe.

Book I reference:
http://www.amazon.com/Introduction-Theory-Computation-Michael-Sipser/dp/113318779X

Tags and Topics

Browse our collection to discover more content in these categories.

Video Information

Views

1.1K

Likes

30

Duration

19:26

Published

Feb 26, 2016

User Reviews

4.5
(1)
Rate:

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.