Automata Theory inside a RegExp machine
Category: Tutorials
- views: 108
- date: 25 June 2024
- posted by: voska89
Free Download Automata Theory inside a RegExp machine
Dmitry Soshnikov | Duration: 1:47 h | Video: H264 1280x720 | 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.
In this class we study the Automata Theory on the practical example of implementing a Regular Expressions machine.
Homepage
https://dmitrysoshnikov.teachable.com/p/automata-theory-building-a-regexp-machineDOWNLOAD LINK
No Password - Links are Interchangeable
We need your support!
Make a donation to help us stay online
Bitcoin (BTC)
bc1q08g9d22cxkawsjlf8etuek2pc9n2a3hs4cdrld
Bitcoin Cash (BCH)
qqvwexzhvgauxq2apgc4j0ewvcak6hh6lsnzmvtkem
Ethereum (ETH)
0xb55513D2c91A6e3c497621644ec99e206CDaf239
Litecoin (LTC)
ltc1qt6g2trfv9tjs4qj68sqc4uf0ukvc9jpnsyt59u
USDT (ERC20)
0xb55513D2c91A6e3c497621644ec99e206CDaf239
USDT (TRC20)
TYdPNrz7v1P9riWBWZ317oBgJueheGjATm
Information |
|||
 |
Users of GUESTS are not allowed to comment this publication. | ||