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.
State machines are supported by the broader theoretical field of computer science known as the Theory of Computation, and also by its direct theoretical model: the Theory of Automata.
In this course we study the Theory of Automata on the practical example of implementing a machine for Regular Expressions.
[links]RAPIDGATOR:
rapidgator.net/file/19e80d2a2c106e708346b71b41505640/Dmitry_Soshnikov_-_Automata_Theory_inside_a_RegExp_machine.rar.html
TURBOBIT:
trbt.cc/trzjpwg1pkhe/Dmitry_Soshnikov_-_Automata_Theory_inside_a_RegExp_machine.rar.html
[/links