Algorithmic problems on pseudovarieties of finite semigroups as algebraic translation of questions about automata and languages. Relatively free profinite semigroups as adequate structures to describe common algebraic and combinatorial properties of the members of a pseudovariety and how they can be used to solve algorithmic problems.
