Free Download Automata Theory inside a RegExp machine
Dmitry Soshnikov | Duration: 1:47 h | Video: H264 1280×720 | Audio: AAC 44,1 kHz 2ch | 393 MB | Language: English
Deep dive into state machines, Finite automata, and Regular expressions
State machines – the fundamental concept used today in many practical applications, starting from UI programming like React, automated reply systems, lexical analysis in parsers and formal language theory – i.e. the RegExp machines, – and up to real life use cases, such as simple traffic lights, vending machines, and others.
The state machines are backed by the larger theoretical field of computer science known as Theory of Computation, and also by its direct theoretical model – the Automata Theory.
