JUST BECAUSE SOME LANGUAGE HAS BEEN PROVEN TO BE REGULAR IT DOESN'T NECESSARILY MEAN THAT IT IS PRACTICAL, FEASIBLE,
THERE IS ENOUGH PAPERS ON EARTH TO DRAW THE GRAPH OF THE DETERMINISTIC FINITE AUTOMATON THAT ACCEPTS THE LANGUAGE AND THAT THERE IS ENOUGH RESOURCES, MONEY AND TIME TO BUILD IT; COMPUTER AND MACHINE ENGINEERS, SCIENTISTS AND TECHNICIANS