Dmitry Soshnikov – Automata Theory inside a RegExp machine
English | Tutorial | Size: 393.20 MB

State machines: the fundamental concept used today in many practical applications, from user interface programming such as React, automated response systems, lexical analysis in parsers and formal language theory – i.e. RegExp machines, – to real-life use cases such as simple traffic lights, vending machines and others.