Nelma Moreira is a professor at the Department of Computer Science, Faculty ofSciences, University of Porto, Portugal. In 1984, she received a degree in Applied Mathematics, Faculty of Sciences, University of Porto; and in 1997 a PhD degree in Computer Science from University of Porto. She has worked in logic programming and natural language processing. Her current research interests are in the area of automata theory and formal languages; descriptional complexity; and dependable software. She has several publications on international journals and conferences concerning enumerative and random generation of finite automata; succinct conversions between equivalent models of regular languages and, in particular, average-case complexity based on analytic combinatorics.