Overview
In this 1 hr course, explore the fundamentals of state machines and finite automata by building a Regular Expression machine. Guided by expert Dmitry Soshnikov, you'll deep dive into non-deterministic and deterministic finite automata, and the theory behind pattern matching and lexical analysis.
What I will be able to do after this course
- Develop an understanding of regular grammars through practical examples.
- Implement and work with NFAs, including character and epsilon NFA fragments.
- Design a full-scale Regular Expression machine from scratch.
- Gain insights into state machines and their real-world applications.
- Master traversal techniques in finite automata, including both NFA and DFA.
Course Instructor(s)
Dmitry Soshnikov, a knowledgeable and engaging educator, specializes in computer science concepts involving algorithms and data structures. With experience in teaching and implementing complex theoretical topics in practical forms, Dmitry brings an organized and crisp approach to his instruction.
Who is it for?
This course is perfect for engineers already familiar with the basics of regular expressions who desire to deepen their knowledge by learning how they are implemented. People interested in compiler design, lexical analysis, or computational theory will also find this course valuable and insightful.
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Watch now
Unlock full access