| A survey on operational state complexity Y Gao, N Moreira, R Reis, S Yu arXiv preprint arXiv:1509.03254, 2015 | 99 | 2015 |
| YAP User’s manual VS Costa, L Damas, R Reis, R Azevedo Universidade do Porto, version 4, 20, 2002 | 83* | 2002 |
| Enumeration and generation with a string automata representation M Almeida, N Moreira, R Reis Theoretical Computer Science 387 (2), 93-102, 2007 | 63 | 2007 |
| FAdo and GUItar: tools for automata manipulation and visualization A Almeida, M Almeida, J Alves, N Moreira, R Reis International conference on implementation and application of automata, 65-74, 2009 | 55 | 2009 |
| On the performance of automata minimization algorithms M Almeida, N Moreira, R Reis Logic and Theory of Algorithms, 3, 2007 | 55 | 2007 |
| Testing the equivalence of regular languages M Almeida, N Moreira, R Reis arXiv preprint arXiv:0907.5058, 2009 | 43 | 2009 |
| On the average state complexity of partial derivative automata: an analytic combinatorics approach S Broda, A Machiavelo, N Moreira, R Reis International Journal of Foundations of Computer Science 22 (07), 1593-1606, 2011 | 41 | 2011 |
| On the average size of Glushkov and partial derivative automata S Broda, A Machiavelo, N Moreira, R Reis International Journal of Foundations of Computer Science 23 (05), 969-984, 2012 | 40 | 2012 |
| Antimirov and Mosses's rewrite system revisited M Almeida, N Moreira, R Reis International Journal of Foundations of Computer Science 20 (04), 669-684, 2009 | 32 | 2009 |
| A static type inference for python E Maia, N Moreira, R Reis Proc. of DYLA 5 (1), 1, 2012 | 31 | 2012 |
| Automata for regular expressions with shuffle S Broda, A Machiavelo, N Moreira, R Reis Information and Computation 259, 162-173, 2018 | 30 | 2018 |
| A Hitchhiker's Guide to descriptional complexity through analytic combinatorics S Broda, A Machiavelo, N Moreira, R Reis Theoretical Computer Science 528, 85-100, 2014 | 26 | 2014 |
| Interactive manipulation of regular objects with FAdo N Moreira, R Reis ACM SIGCSE Bulletin 37 (3), 335-339, 2005 | 25 | 2005 |
| Partitions into sum-free sets PF Blanchard, F Harary, R Reis Integers 6, A7, 2006 | 24 | 2006 |
| On the density of languages representing finite set partitions N Moreira, R Reis Journal of Integer Sequences 8 (05.2), 8, 2005 | 23 | 2005 |
| Symmetric groups and quotient complexity of boolean operations J Bell, J Brzozowski, N Moreira, R Reis International Colloquium on Automata, Languages, and Programming, 1-12, 2014 | 22 | 2014 |
| On the representation of finite automata R Reis, N Moreira, M Almeida arXiv preprint arXiv:0906.2477, 2009 | 21 | 2009 |
| On the Average Complexity of Partial Derivative Automata for Semi-extended Expressions. R Bastos, S Broda, A Machiavelo, N Moreira, R Reis J. Autom. Lang. Comb. 22 (1-3), 5-28, 2017 | 20 | 2017 |
| A review on state complexity of individual operations Y Gao, N Moreira, R Reis, S Yu Computer Science Review.(Available at www. dcc. fc. up. pt/dcc/Pubs/TReports …, 2012 | 18 | 2012 |
| The computational power of parsing expression grammars B Loff, N Moreira, R Reis Journal of Computer and System Sciences 111, 1-21, 2020 | 16 | 2020 |
Nelma MoreiraUniversidade do PortoVerified email at fc.up.pt
