Notes

• The requirement that DFA::tag_type be hash_tag is a minimal assumption. The tag type can be anything provided that it is at least a hash_tag.
• The DFA must stores the transitions in sorted containers which means that this algorithm can not be used on containers DFA_mtf, DFA_hash and DFA_tr.
• A DFA must be rehashed each time it undergoes any modifications.