#automata

Automata, computation, and regex turn out to be three vocabularies for one underlying idea. - Study Notes

• #automata
• #regex
• #computation

Building a working regex engine by hand, Thompson's construction, subset construction, and a linear-time matcher. - Study Notes

• #automata
• #regex
• #algorithms

Why nondeterministic finite automata are no more powerful than DFAs, proved by subset construction. - Study Notes

• #automata
• #nfa
• #dfa

Extending finite automata from yes/no acceptors into machines that act, using an elevator as the model. - Study Notes

• #automata
• #state-machines

A precise definition of "language" in computer science, and why JavaScript isn't a regular one. - Study Notes

• #automata
• #formal-languages

Why a useState/useReducer component is, formally, a deterministic finite automaton. - Study Notes

• #automata
• #react
• #state-machines