English | MP4 | AVC 1280×720 | AAC 44KHz 2ch | 16 Lessons (1h 47m) | 393 MB
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.
In this class we study the Automata Theory on the practical example of implementing a Regular Expressions machine.
Table of Contents
Formal grammars and Finite automata
1 RegExp history
2 Regular grammars
3 Finite automata
RegExp NFA fragments
4 Character and Epsilon NFA
5 Concatenation pattern AB
6 Union pattern AB
7 Kleene closure A
8 Complex machines
9 Syntactic sugar
10 NFA optimizations
RegExp machine
11 NFA acceptor
12 NFA table
13 RegExp-Tree tool
14 DFA table
15 DFA minimization
16 RegExp match
Resolve the captcha to access the links!