👨‍💻 RegEx FSA implementation

How to implement 🔡 Regular Expressions using 🏁 Finite state automata

Methods

use either…

• 1️⃣ Deterministic finite automata
• 🔢 Non-deterministic finite automata

📖 Example:

Match: /Hey/

• Type: 1️⃣ Deterministic finite automata

State transition diagram

graph LR
q0 --"H"--> q1
q1 --"e"--> q2
q2 --"y"--> qf

State transition table

state/input	H	e	y
q0	q1	0	0
q1	0	q2	0
q2	0	0	qf