Greenplum team will do big-standup each workday. The team hosting the big-standup will try to find some interesting games for the whole team to play during the big-standup. Today one colleague comes up with a game to write regular expression for given DFA. The RE is so cute that I cannot resist writing it down.

The problem

This problem is originated from HMU’s homework for DFA. The automata is shown by the picture below:

Continue reading →