A deterministic finite automata (DFA) for all the different ways to spell Chanukah. And if you’re a regular expression geek, it’s (Ch|H)an(n?)uk(k?)a(h?) - Avidan Ackerson 

A deterministic finite automata (DFA) for all the different ways to spell Chanukah. And if you’re a regular expression geek, it’s (Ch|H)an(n?)uk(k?)a(h?)

- Avidan Ackerson