What are the applications of Finite automata?

Gives the substitute a single blank for the first string of two or more blanks in a given line. In UNIX text editors any reg exp is converted to an NFA with ε- transitions, this NFA can be then simulated directly.