[2013-24] Maia E, Moreira N, Reis R. The Operational Incomplete Transition Complexity on Finite Languages .Edit

[2013-21] Bastos R, Moreira N, Reis R. Manipulation of extended regular expressions with derivatives .Edit

[2014-37] Broda S, Cavadas S, Moreira N. Kleene Algebra Completeness DCC-FC & CMUP, Universidade do Porto .Edit

[2013-22] Broda S, Machiavelo A, Moreira N, Reis R. Glushkov and Equation Automata for KAT Expressions .

[2011-36] Moreira N, Nabais D, Reis R. DesCo: a Web Based Information System for Descriptional Complexity Results .Edit

[2013-23] Nabais D, Moreira N, Reis R. Desco: a knowledge based system for descriptional complexity of formal languages .Edit

[2014-36] Broda S, Cavadas S, Moreira N. Derivative Based Methods for Deciding SKA and SKAT DCC-FC & CMUP, Universidade do Porto .Edit

[2014-35] Broda S, Machiavelo A, Moreira N, Reis R. Automata for KAT Expressions DCC-FC, Universidade do Porto .

Maia E, Moreira N, Reis R. Partial Derivative and Position Bisimilarity Automata. Vol 8587. Holzer M, Kutrib M, editors SV 2014 (LNCS; vol 8587).Edit

Moreira N, Pighizzini G, Reis R. Optimal State Reductions of Automata with Partially Specified Behaviors Springer 2015 (LNCS).Edit

Broda S, Machiavelo A, Moreira N, Reis R. The average transition complexity of Glushkov and partial derivative automata. In: Developments in language theory. Vol 6795. Springer, Heidelberg; 2011. 9. p. 93-104p. (Lecture Notes in Comput. Sci.; vol 6795).Edit

Broda S, Machiavelo A, Moreira N, Reis R. On the average number of states of partial derivative automata. In: Developments in language theory. Vol 6224. Springer, Berlin; 2010. 1. p. 112-123p. (Lecture Notes in Comput. Sci.; vol 6224).Edit

Seventh Workshop on Non-Classical Models of Automata and Applications (NCMA 2015). Freund R, Holzer M, Moreira N, Reis R, editors Österreichische Computer Gesellschaft 2015.Edit

The Role of Theory in Computer Science: Essays Dedicated to Janusz Brzozowski. Konstantinidis S, Moreira N, Reis R, Shallit J, editors World Scientific 2017.Edit

Implementation and Application of Automata, 17th International Conference (CIAA 2012). Vol 7381. Moreira N, Reis R, editors Springer 2012.

Almeida M, Moreira N, Reis R. Finite automata minimization algorithms. Wang J, editor Chapman and Hall/CRC Press 2012.Edit

Descriptional Complexity of Formal Systems, 14th International Workshop (DCFS 2012). Vol 7386. Kutrib M, Moreira N, Reis R, editors Springer 2012.Edit

Gao Y, Moreira N, Reis R, Yu S. A Survey on Operational State Complexity. Journal of Automata, Languages and Combinatorics. 2017;21:251-310.Edit

Moreira N, Reis R. Preface. Special Issue - Implementation and Application of Automata (CIAA 2012). International Journal of Fundations of Computer Science. 2013;24:689-690.

Moreira N, Pighizzini G, Reis R. Optimal State Reductions of Automata with Partially Specified Behaviors. Theoretical Computer Science. 2017;658:235-245.Edit

Almeida M, Moreira N, Reis R. Incremental DFA Minimisation. RAIRO - Theoretical Informatics and Applications. 2014;48:173-186.Edit

Maia E, Moreira N, Reis R. Incomplete Transition Complexity on Finite and Infinite Regular Languages. Information and Computation. 2015;244:1-22.Edit

Broda S, Machiavelo A, Moreira N, Reis R. A Hitchhiker's Guide to descriptional complexity through analytic combinatorics. Theoret. Comput. Sci.. 2014;528:85-100.Edit

Câmpeanu C, Moreira N, Reis R. Distinguishability Operations and Closures. Fundamenta Informaticae. 2016;148:243-266.Edit

Broda S, Machiavelo A, Moreira N, Reis R. On the Average State Complexity of Partial Derivative Automata: an analytic combinatorics approach. International Journal of Foundations of Computer Science. 2011;22:1593-1606.