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

  • Some aspects of descent theory and applications
      Rui Rodrigues de Abreu Fernandes Prezado (January 2024)
      Maria Manuel Clementino
      Fernando Lucatelli Nunes
  • Comparability between different systems: star-shaped and convex transform orders
      Beatriz Ferreira Santos (December 2023)
      Paulo Eduardo Oliveira
      Idir Arab
  • On Lax Idempotent Monads in Topology
      Carlos Miguel Alves Fitas (December 2023)
      Maria Manuel Clementino
More Theses