Nelma Moreira

Eva Maia, Nelma Moreira, Rogério Reis: Incomplete Transition Complexity of Some Basic Operations. SOFSEM 2013: 319-331

Eva Maia, Nelma Moreira, Rogério Reis: Incomplete Transition Complexity of Basic Operations on Finite Languages. CoRR abs/1302.0750 (2013)

Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis: On the Average Size of Glushkov and Partial derivative Automata. Int. J. Found. Comput. Sci. 23(5): 969-984 (2012)

Nelma Moreira, David Pereira, Simão Melo de Sousa: Deciding Regular Expressions (In-)Equivalence in Coq. RAMICS 2012: 98-113

Ricardo Almeida, Sabine Broda, Nelma Moreira: Deciding KAT and Hoare Logic with Derivatives. GandALF 2012: 127-140

Martin Kutrib, Nelma Moreira, Rogério Reis (Eds.): Descriptional Complexity of Formal Systems - 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings. Lecture Notes in Computer Science 7386, Springer 2012, isbn 978-3-642-31622-7

Nelma Moreira, Rogério Reis (Eds.): Implementation and Application of Automata - 17th International Conference, CIAA 2012, Porto, Portugal, July 17-20, 2012. Proceedings. Lecture Notes in Computer Science 7381, Springer 2012, isbn 978-3-642-31605-0

Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis: On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach. Int. J. Found. Comput. Sci. 22(7): 1593-1606 (2011)

Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis: The Average Transition Complexity of Glushkov and Partial Derivative Automata. Developments in Language Theory 2011: 93-104

Marco Almeida, Nelma Moreira, Rogério Reis: Testing the Equivalence of Regular Languages. Journal of Automata, Languages and Combinatorics 15(1/2): 7-25 (2010)

Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis: On the Average Number of States of Partial Derivative Automata. Developments in Language Theory 2010: 112-123

Marco Almeida, Nelma Moreira, Rogério Reis: Incremental DFA Minimisation. CIAA 2010: 39-48

José Bacelar Almeida, Nelma Moreira, David Pereira, Simão Melo de Sousa: Partial Derivative Automata Formalized in Coq. CIAA 2010: 59-68

Nelma Moreira, Davide Nabais, Rogério Reis: State Elimination Ordering Strategies: Some Experimental Results. DCFS 2010: 139-148

Hugo Gouveia, Nelma Moreira, Rogério Reis: Small NFAs from Regular Expressions: Some Experimental Results. CoRR abs/1009.3599 (2010)

Nelma Moreira, Rogério Reis: Series-Parallel Automata and Short Regular Expressions. Fundam. Inform. 91(3-4): 611-629 (2009)

Marco Almeida, Nelma Moreira, Rogério Reis: Antimirov and Mosses's Rewrite System Revisited. Int. J. Found. Comput. Sci. 20(4): 669-684 (2009)

André Almeida, Marco Almeida, José Alves, Nelma Moreira, Rogério Reis: FAdo and GUItar. CIAA 2009: 65-74

Marco Almeida, Nelma Moreira, Rogério Reis: Testing the Equivalence of Regular Languages. DCFS 2009: 47-57

Rogério Reis, Nelma Moreira, Marco Almeida: On the Representation of Finite Automata. CoRR abs/0906.2477 (2009)

Marco Almeida, Nelma Moreira, Rogério Reis: Aspects of enumeration and generation with a string automata representation. CoRR abs/0906.3853 (2009)

Marco Almeida, Nelma Moreira, Rogério Reis: Exact generation of acyclic deterministic finite automata. CoRR abs/0908.3315 (2009)

David Pereira, Nelma Moreira: KAT and PHL in Coq. Comput. Sci. Inf. Syst. 5(2): 137-160 (2008)

Marco Almeida, Nelma Moreira, Rogério Reis: Exact Generation of Minimal Acyclic Deterministic Finite Automata. Int. J. Found. Comput. Sci. 19(4): 751-765 (2008)

Marco Almeida, Nelma Moreira, Rogério Reis: Exact Generation of Acyclic Deterministic Finite Automata. DCFS 2008: 48-60

Marco Almeida, Nelma Moreira, Rogério Reis: Antimirov and Mosses's Rewrite System Revisited. CIAA 2008: 46-56

Marco Almeida, Nelma Moreira, Rogério Reis: Enumeration and generation with a string automata representation. Theor. Comput. Sci. 387(2): 93-102 (2007)

David Pereira, Eugénio C. Oliveira, Nelma Moreira: Formal Modelling of Emotions in BDI Agents. CLIMA 2007: 62-81

Marco Almeida, Nelma Moreira, Rogério Reis: Exact Generation of Minimal Acyclic Deterministic Finite Automata. DCFS 2007: 57-68

Marco Almeida, Nelma Moreira, Rogério Reis: Aspects of Enumeration and Generation with a String Automata Representation. DCFS 2006: 58-69

Ana Paula Tomás, Nelma Moreira, Nuno Pereira: Designing a Solver for Arithmetic Constraints to Support Education in Mathematics. AIAI 2006: 433-441

Rogério Reis, Nelma Moreira, Marco Almeida: On the Representation of Finite Automata. DCFS 2005: 269-276

Nelma Moreira, Rogério Reis: Interactive manipulation of regular objects with FAdo. ITiCSE 2005: 335-339

José João Morais, Nelma Moreira, Rogério Reis: Acyclic Automata with Easy-to-Find Short Regular Expressions. CIAA 2005: 349-350

Rogério Reis, Nelma Moreira: Apoo: an environment for a first course in assembly language programming. SIGCSE Bulletin 33(4): 43-47 (2001)

Luís Damas, Nelma Moreira: Constraint Categorial Grammars. EPIA 1995: 347-358

Luís Damas, Nelma Moreira: Constraint Categorial Grammars. CoRR abs/cmp-lg/9507001 (1995)

Luís Damas, Nelma Moreira, Sabine Broda: Resolution of Constraints in Algebras of Rational Trees. EPIA 1993: 61-76

Luís Damas, Giovanni B. Varile, Nelma Moreira: The Formal and Processing Models of CLG. EACL 1991: 173-178

José Paulo Leal, Luís Damas, Nelma Moreira: An History Based Interface. LPE 1991: 10-16

Miguel Filgueiras, Luís Damas, Nelma Moreira, Ana Paula Tomás (Eds.): Natural Language Processing, EAIA '90, 2nd Advanced School in Artificial Intelligence, Guarda, Portugal, October 8-12, 1990, Proceedings. Lecture Notes in Computer Science 476, Springer 1991, isbn 3-540-53678-7

Sergio Balari, Giovanni B. Varile, Luís Damas, Nelma Moreira: CLG(n): Constraint Logic Grammars. COLING 1990: 7-12

Miguel Filgueiras, Nelma Moreira, Ana Paula Tomás: General Introduction. EAIA 1990: 1-3

Miguel Filgueiras, Ana Paula Tomás, Nelma Moreira, Rogério Reis, José Paulo Leal: Natural Language and Natural Menus Interfaces. Modelling the Innovation 1990: 299-306

Nelma Moreira: Semantic Analysis of Time and Tense in Natural Language: An Implementation. EPIA 1989: 198-209