PT EN

Finite and Profinite Semigroups

Program

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.

Research and Events

Events

  • There is no information available on this topic.
More Events

Defended Theses

  • Numerical semigroups: a conjecture of Wilf and related topics
      Neeraj Kumar (July 2025)
      Manuel Delgado
      Claude Marion
  • Dynamics of vector fields with univalued solutions
      Laura Rosales Ortiz (June 2025)
      Helena Reis
      Júlio Rebelo (Université Toulouse III)
  • Regular transitions of physical measures in nonuniformly hyperbolic systems
      Odaudu Reuben Etubi (April 2025)
      José Ferreira Alves
More Theses