Designing Finite Automata from Regular Expression (Set 1) - GeeksforGeeks
computation models - How design a Deterministic finite automata which accept string starting with 101 and how to draw transition table for it if there is a dead state - Computer Science Stack Exchange