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

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

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

Konstantinidis S, Meijer C, Moreira N, Reis R. Implementation of Code Properties via Transducers. In: Implementation and Application of Automata, 21th International Conference (CIAA 2016).; 2016. Edit

Maia E, Moreira N, Reis R. Incomplete Transition Complexity of Basic Operations on Finite Languages. Konstantinidis S, editor 2013.Edit

Maia E, Moreira N, Reis R. Incomplete Transition Complexity of some Basic Operations. Boas Pvan Emde, Groen FCA, Italiano GF, Nawrocki J, Sack H, editors 2013.Edit

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

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

Almeida M, Moreira N, Reis R. Incremental DFA Minimisation. In: Domaratzki M, Salomaa K, editors. Proceedings of the 15th International Conference on Implementation and Application of Automata (CIAA 2010). Winnipeg, MA, Canada; 2011. 3. p. 39-48p. Edit

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

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

Broda S, Holzer M, Maia E, Moreira N, Reis R. On the Mother of All Automata: the Position Automaton. In: Developments in Language Theory.; 2017. Edit

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

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

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

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

Broda S, Machiavelo A, Moreira N, Reis R. Partial Derivative Automaton for Regular Expressions with Shuffle. In: Shallit J, Okhotin A, editors. Proceedings of the 17th Int. Workshop on Descriptional Complexity of Formal Systems (DCFS15). Springer; 2015. 2. p. 21-32p. Edit

Broda S, Machiavelo A, Moreira N, Reis R. Position automaton construction for regular expressions with intersection. In: Reutenauer C, Brlek S, editors. Developments in Language Theory - 20th International Conference, DLT 2016. Vol 9840. Springer; 2016. 5. p. 51-63p. 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.

Maia E, Moreira N, Reis R. Prefix and Right-Partial Derivative Automata. In: Soskova M, Mitrana V, editors. Computability in Europe (CiE 2015). Springer; 2015. 2. p. 258-267p. 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

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

Bastos R, Broda S, Machiavelo A, Moreira N, Reis R. On the State Complexity of Partial Derivative Automata for Regular Expressions with Intersection. In: Proceedings of the 18th Int. Workshop on Descriptional Complexity of Formal Systems (DCFS16). Vol 9777. Springer; 2016. 4. p. 45-59p. (LNCS; vol 9777).Edit

[2011-37] Broda S, Machiavelo A, Moreira N, Reis R. Study of the Average Size of Glushkov and Partial Derivative Automata .

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