0
Code Yourself a DFA
code-golf or code-challenge
In this challenge, your task is to implement a deterministic finite automaton (DFA for short) that recognizes the following regular language L. The alphabet of L is {x,1,2,3}, and it is the set difference of (1x* + 2(xx)* + 3(xxx)*)* and (x+1+2+3)...