u/forseti_in r/compsci • Recommends
On “P vs NP for beginners?”
Here is an excellent taught course about all this. It starts with finite automatons, regular expressions, push-down machines and turing machines.
0:00 / 0:00
#finitestatemachines#automatatheory#theoryofcomputation
Lecture 1 - Finite State Machines (Part 1/9)
Coderisland
14K subscribers • 3 videos on Hallway
- Recommended by 2 people: 2 in engineering communities.
- Presented by Shai Simonson, Instructor
Beginner. No background in the topic needed.
231K views16 years ago2 recommendations
Computer scienceSystems programmingComputation and complexityCompilers and interpretersAlgorithms
Shai Simonson introduces finite state machines and the theory of computation in this university lecture.
All rights reserved for aduni.org/ Published under the Creative Commons Attribution-ShareAlike license creativecommons.org/licenses/by-sa/2.0/ Tutorials by Instructor: Shai Simonson. stonehill.edu/compsci/shai.htm Visit our website at: coderisland.com Download Lecture Materials: coderisland.com/theory-of-computation-materials/ Follow us on twitter: twitter.com/coderisland Become a fan on Facebook: facebook.com/CoderislandWhy it's here
2 people recommend thisWhat people say. Recommended as an excellent introductory course on finite automata, regular expressions, and Turing machines.
u/frezikin r/programming • Recommends
On “Why Developers Never Use State Machines”
I use state machines all the time--that's what regular expressions are.
Outside that, it all depends on the problem. Even those CS grads who have had exposure to a theory of computation course may never find a good use for them in a professional environment besides regexes and building blocks to learning context-free parsers.
While on this subject, I give a strong recommendation to the ADUni's series of videos on the Theory of Computation.