Research in this area ranges from algebraic topics such as semigroups and groups (finite, profinite, or general) to mathematical models used in computer science, namely various flavors of automata and formal languages. Current work aims not only to contribute to the theories of each of the topics but also to explore the connections between them, with applications in both directions.
The beginning of the area of semigroups, automata and languages (SAL) at CMUP can be traced back to 1987, when Jorge Almeida joined the Pure Mathematics Department at the Faculty of Sciences of the University of Porto. His pioneering work on the profinite approach to finite semigroup theory, which was then starting to flourish, eventually earned him and his school wide international recognition. Several of his doctoral students, including the current Director of CMUP, not only contributed significantly to the area but also eventually proved their autonomy by pursuing different branches of Mathematics. This reflects, in part, the interaction with other areas of Mathematics that Jorge Almeida has always sought, among which deserve particular mention universal algebra, profinite group theory, and symbolic dynamics.
In the early 1990s, another path to this group was opened by the Master's degree in Algebra at the University of Lisbon, which eventually led to four doctorates in the algebraic theory of semigroups (three in the United Kingdom and one in the United States) who integrated the SAL group. Among them, Pedro V. Silva, whose post-doctoral work ranges mostly from combinatorial semigroup and group theory, essentially using automata and language theory methods, to geometric group theory, has deserved widespread international recognition.
After thesis and post-doctoral work on the profinite approach to semigroup theory, since around 2005 Manuel Delgado started developing tools for computing with automata, finite semigroups, and numerical semigroups within the computational algebra software GAP. His non-computational work since then, which has concentrated mostly on numerical semigroups, has been developed in close connection with his computational tools, which have served to discover and test combinatorial and number theoretical phenomena which were hitherto inaccessible.
In 2011, three researchers from the Computer Science Department interested in more computer-science oriented aspects of automata and formal language theory originating from LIACC (Artificial Intelligence and Computer Science Laboratory) joined the SAL line of CMUP. While Nelma Moreira and Rogério Reis have concentrated mostly on the worst-case and average-case descriptional complexity of formal languages, Sabine Broda has also collaborated in part of that work and has interests in richer computational models such as timed automata and Petri nets. Another addition to the group is the number-theorist by formation, António Machiavelo, who has already been involved in collaboration with the colleagues from the Computer Science Department, notably on the average-case descriptional complexity of regular languages and on cryptographic systems.
Temporary Members - PhD students
3rd International Conference on Formal Structures for Computation and Deduction, FSCD 2018, July 9-12, 2018, Oxford, UK | 2018
INFORMATION AND COMPUTATION | 2018
Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25-27, 2018, Proceedings | 2018
COMMUNICATIONS IN ALGEBRA | 2018
MATHEMATISCHE ZEITSCHRIFT | 2018