Description
In the field of computer science, there has been a growing interest in the study of semigroups and monoids in relation to automata and formal languages. We aim to apply techniques from group theory and universal algebra to the analysis of these objects.
Keywords
semigroup, monoid, automaton, formal language, Eilenberg's theorem, class of groups
Manager UV
- Ballester Bolinches, Adolfo
- PDI-Catedratic/a d'Universitat
