State Machines and Automata: Building a RegExp Machine

Understand the underlying theory behind state machines, finite automata, and regular expressions


This course is mainly for compiler engineers. However, all curious engineers willing to tackle a complex project building a RegExp machine based on finite automata would find it useful. Notice that this class is not about how to use regular expressions (you should already know what a regular expression is and actively use it on practice as a prerequisite for this class), but rather about how to implement the regular expressions—again, with the goal to study generic complex systems.


  • Learn about the theory of computation
  • Learn about state machines and finite automata
  • Learn about graphs, traversal, states, and transitions
  • Learn how to build a full RegExp machine
  • Learn about non-deterministic and deterministic finite automata
  • Learn about formal grammar and finite automata


  •  And there is a simple trick how you can gain great experience with transferable knowledge to other systems 
Show More


  • No Feedbacks Posted Yet..!
State Machines and Automata: Building a RegExp Machine
This Course Includes
  • 1.5 hours
  • 16 Lectures
  • Completion Certificate
  • Lifetime Access
  • 30-Days Money Back Guarantee

Sample Certificate

Use your certification to make a career change or to advance in your current career. Salaries are among the highest in the world.

We have 30 Million registgered users and counting who have advanced their careers with us.


Sample Certificate