algo: check if language of regexp is infinite

This new easy algorithm checks whether a regexp's language is an
infinite language.
Also adding an AQL test to compare with the same algorithm on finite
automata.