Semantic Analysis of Time and Tense in Natural Language: An Implementation. - Nelma Moreira (EPIA, 1989)

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

General Introduction. - Miguel Filgueiras; Nelma Moreira; Ana Paula Tomás (EAIA, 1990)

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

The Formal and Processing Models of CLG. - Luís Damas; Giovanni B. Varile; Nelma Moreira (EACL, 1991)

An History Based Interface. - José Paulo Leal; Luís Damas; Nelma Moreira (LPE, 1991)

Resolution of Constraints in Algebras of Rational Trees. - Luís Damas; Nelma Moreira; Sabine Broda (EPIA, 1993)

Constraint Categorial Grammars. - Luís Damas; Nelma Moreira (EPIA, 1995)

Apoo: an environment for a first course in assembly language programming. - Rogério Reis; Nelma Moreira (ACM SIGCSE Bull., 2001)

On the Representation of Finite Automata. - Rogério Reis; Nelma Moreira; Marco Almeida (DCFS, 2005)

Interactive manipulation of regular objects with FAdo. - Nelma Moreira; Rogério Reis (ITiCSE, 2005)

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

Aspects of Enumeration and Generation with a String Automata Representation. - Marco Almeida; Nelma Moreira; Rogério Reis (DCFS, 2006)

Designing a Solver for Arithmetic Constraints to Support Education in Mathematics. - Ana Paula Tomás; Nelma Moreira; Nuno Pereira 001 (AIAI, 2006)

Formal Modelling of Emotions in BDI Agents. - David Pereira; Eugénio C. Oliveira; Nelma Moreira (CLIMA, 2007)

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

Exact Generation of Acyclic Deterministic Finite Automata. - Marco Almeida; Nelma Moreira; Rogério Reis (DCFS, 2008)

KAT and PHL in Coq. - David Pereira; Nelma Moreira (Comput. Sci. Inf. Syst., 2008)

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

FAdo and GUItar. - André Almeida; Marco Almeida; José Alves; Nelma Moreira; Rogério Reis (CIAA, 2009)

Testing the Equivalence of Regular Languages - Marco Almeida; Nelma Moreira; Rogério Reis (DCFS, 2009)

Series-Parallel Automata and Short Regular Expressions. - Nelma Moreira; Rogério Reis (Fundam. Informaticae, 2009)

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

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

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

State Elimination Ordering Strategies: Some Experimental Results - Nelma Moreira; Davide Nabais; Rogério Reis (DCFS, 2010)

Small NFAs from Regular Expressions: Some Experimental Results - Hugo Gouveia; Nelma Moreira; Rogério Reis (CoRR, 2010)

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

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

Deciding Regular Expressions (In-)Equivalence in Coq. - Nelma Moreira; David Pereira; Simão Melo de Sousa (RAMiCS, 2012)

Deciding KAT and Hoare Logic with Derivatives - Ricardo Almeida 003; Sabine Broda; Nelma Moreira (GandALF, 2012)

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

Editorial. - Jürgen Dassow; Martin Kutrib; Nelma Moreira; Rogério Reis (J. Autom. Lang. Comb., 2012)

Finite Automata Minimization. - Marco Almeida; Nelma Moreira; Rogério Reis (Handbook of Finite State Based Models and Applications, 2012)

On the Average Size of Glushkov and Equation Automata for KAT Expressions. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (FCT, 2013)

Incomplete Transition Complexity of Some Basic Operations. - Eva Maia; Nelma Moreira; Rogério Reis (SOFSEM, 2013)

Incomplete Transition Complexity of Basic Operations on Finite Languages. - Eva Maia; Nelma Moreira; Rogério Reis (CIAA, 2013)

Preface. - Nelma Moreira; Rogério Reis (Int. J. Found. Comput. Sci., 2013)

On the Equivalence of Automata for KAT-expressions. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (CiE, 2014)

Symmetric Groups and Quotient Complexity of Boolean Operations. - Jason P. Bell; Janusz A. Brzozowski; Nelma Moreira; Rogério Reis (ICALP (2), 2014)

The distinguishability operation on regular languages. - Cezar Câmpeanu; Nelma Moreira; Rogério Reis (NCMA, 2014)

Partial Derivative and Position Bisimilarity Automata. - Eva Maia; Nelma Moreira; Rogério Reis (CIAA, 2014)

Incremental DFA minimisation. - Marco Almeida; Nelma Moreira; Rogério Reis (RAIRO Theor. Informatics Appl., 2014)

A Hitchhiker's Guide to descriptional complexity through analytic combinatorics. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (Theor. Comput. Sci., 2014)

Prefix and Right-Partial Derivative Automata. - Eva Maia; Nelma Moreira; Rogério Reis (CiE, 2015)

Partial Derivative Automaton for Regular Expressions with Shuffle. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (DCFS, 2015)

Universal Disjunctive Concatenation and Star. - Nelma Moreira; Giovanni Pighizzini; Rogério Reis (DCFS, 2015)

Deciding Synchronous Kleene Algebra with Derivatives. - Sabine Broda; Sílvia Cavadas; Miguel Ferreira; Nelma Moreira (CIAA, 2015)

Formalization of context-free language theory. - Marcus V. M. Ramos; Ruy J. G. B. de Queiroz; Nelma Moreira; José Carlos Bacelar Almeida (CoRR, 2015)

Average Size of Automata Constructions from Regular Expressions. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (Bull. EATCS, 2015)

Incomplete operational transition complexity of regular languages. - Eva Maia; Nelma Moreira; Rogério Reis (Inf. Comput., 2015)

Deciding Kleene algebra terms equivalence in Coq. - Nelma Moreira; David Pereira; Simão Melo de Sousa (J. Log. Algebraic Methods Program., 2015)

On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection. - Rafaela Bastos; Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (DCFS, 2016)

Position Automaton Construction for Regular Expressions with Intersection. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (DLT, 2016)

On the dissimilarity operation on finite languages. - Cezar Câmpeanu; Nelma Moreira; Rogério Reis (NCMA, 2016)

Generating error control codes with automata and transducers. - Stavros Konstantinidis; Nelma Moreira; Rogério Reis (NCMA, 2016)

Automata Serialization for Manipulation and Drawing. - Miguel Ferreira; Nelma Moreira; Rogério Reis (SLATE, 2016)

Implementation of Code Properties via Transducers. - Stavros Konstantinidis; Casey Meijer; Nelma Moreira; Rogério Reis (CIAA, 2016)

On the Formalization of Some Results of Context-Free Language Theory. - Marcus Vinícius Midena Ramos; Ruy J. G. B. de Queiroz; Nelma Moreira; José Carlos Bacelar Almeida (WoLLIC, 2016)

Channels with Synchronization/Substitution Errors and Computation of Error Control Codes. - Stavros Konstantinidis; Nelma Moreira; Rogério Reis (CoRR, 2016)

Distinguishability Operations and Closures. - Cezar Câmpeanu; Nelma Moreira; Rogério Reis (Fundam. Informaticae, 2016)

Formalization of the pumping lemma for context-free languages. - Marcus Vinícius Midena Ramos; José Carlos Bacelar Almeida; Nelma Moreira; Ruy José Guerra Barretto de Queiroz (J. Formaliz. Reason., 2016)

On the Average Complexity of Strong Star Normal Form. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (DCFS, 2017)

On the Mother of All Automata: The Position Automaton. - Sabine Broda; Markus Holzer 001; Eva Maia; Nelma Moreira; Rogério Reis (DLT, 2017)

On the Average Complexity of Partial Derivative Automata for Semi-extended Expressions. - Rafaela Bastos; Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (J. Autom. Lang. Comb., 2017)

A Survey on Operational State Complexity. - Yuan Gao 001; Nelma Moreira; Rogério Reis; Sheng Yu 001 (J. Autom. Lang. Comb., 2017)

Optimal state reductions of automata with partially specified behaviors. - Nelma Moreira; Giovanni Pighizzini; Rogério Reis (Theor. Comput. Sci., 2017)

Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs. - Miguel Ferreira; Nelma Moreira; Rogério Reis (DCFS, 2018)

Some Applications of the Formalization of the Pumping Lemma for Context-Free Languages. - Marcus V. M. Ramos; José Carlos Bacelar Almeida; Nelma Moreira; Ruy J. G. B. de Queiroz (LSFA, 2018)

Automata for regular expressions with shuffle. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (Inf. Comput., 2018)

Randomized generation of error control codes with automata and transducers. - Stavros Konstantinidis; Nelma Moreira; Rogério Reis (RAIRO Theor. Informatics Appl., 2018)

Position Automata for Semi-extended Expressions. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (J. Autom. Lang. Comb., 2018)

Symbolic Manipulation of Code Properties. - Stavros Konstantinidis; Casey Meijer; Nelma Moreira; Rogério Reis (J. Autom. Lang. Comb., 2018)

Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels. - Stavros Konstantinidis; Nelma Moreira; João Pires 002; Rogério Reis (CIAA, 2019)

A mesh of automata. - Sabine Broda; Markus Holzer 001; Eva Maia; Nelma Moreira; Rogério Reis (Inf. Comput., 2019)

On Average Behaviour of Regular Expressions in Strong Star Normal Form. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (Int. J. Found. Comput. Sci., 2019)

On the Average State Complexity of Partial Derivative Transducers. - Stavros Konstantinidis; António Machiavelo; Nelma Moreira; Rogério Reis (SOFSEM, 2020)

Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels. - Stavros Konstantinidis; Nelma Moreira; Rogério Reis; Joshua Young (Int. J. Found. Comput. Sci., 2020)

The computational power of parsing expression grammars. - Bruno Loff; Nelma Moreira; Rogério Reis (J. Comput. Syst. Sci., 2020)

Guest Column: Analytic Combinatorics and Descriptional Complexity of Regular Languages on Average. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (SIGACT News, 2020)

On the Uniform Distribution of Regular Expressions. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (DCFS, 2021)

Partial Derivative Automaton by Compressing Regular Expressions. - Stavros Konstantinidis; António Machiavelo; Nelma Moreira; Rogério Reis (DCFS, 2021)

Location Based Automata for Expressions with Shuffle. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (LATA, 2021)

On the size of partial derivatives and the word membership problem. - Stavros Konstantinidis; António Machiavelo; Nelma Moreira; Rogério Reis (Acta Informatica, 2021)

The Prefix Automaton. - Sabine Broda; Eva Maia; Nelma Moreira; Rogério Reis (J. Autom. Lang. Comb., 2021)

Partial derivatives of regular expressions over alphabet-invariant and user-defined labels. - Stavros Konstantinidis; Nelma Moreira; Rogério Reis (Theor. Comput. Sci., 2021)

Hot Current Topics of Descriptional Complexity. - Martin Kutrib; Nelma Moreira; Giovanni Pighizzini; Rogério Reis (IFIP's Exciting First 60+ Years, 2021)

Approximate NFA Universality Motivated by Information Theory. - Stavros Konstantinidis; Mitja Mastnak; Nelma Moreira; Rogério Reis (DCFS, 2022)

Manipulation of Regular Expressions Using Derivatives: An Overview. - Nelma Moreira; Rogério Reis (CIAA, 2022)

Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (CIAA, 2023)

Special Issue: 25th International Conference on Developments in Language Theory (DLT 2021) - Preface. - Nelma Moreira; Rogério Reis (Int. J. Found. Comput. Sci., 2023)

Location automata for synchronised shuffle expressions. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (J. Log. Algebraic Methods Program., 2023)

On the average complexity of partial derivative transducers. - Stavros Konstantinidis; António Machiavelo; Nelma Moreira; Rogério Reis (Theor. Comput. Sci., 2023)

Approximate NFA universality and related problems motivated by information theory. - Stavros Konstantinidis; Mitja Mastnak; Nelma Moreira; Rogério Reis (Theor. Comput. Sci., 2023)

Location automata for regular expressions with shuffle and intersection. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (Inf. Comput., 2023)

Block Languages and Their Bitmap Representations. - Guilherme Duarte 001; Nelma Moreira; Luca Prigioniero; Rogério Reis (CIAA, 2024)

On the Representation of Block Languages. - Guilherme Duarte 001; Nelma Moreira; Luca Prigioniero; Rogério Reis (CoRR, 2024)

Operational State Complexity of Block Languages. - Guilherme Duarte 001; Nelma Moreira; Luca Prigioniero; Rogério Reis (NCMA, 2024)

On the difference set of two transductions. - Stavros Konstantinidis; Nelma Moreira; Rogério Reis; Juraj Sebej (Theor. Comput. Sci., 2024)

Automata for Synchronised Shuffle on Backbones. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (DCFS, 2025)

Two-Word Shuffle: Some Results. - Guilherme Duarte 001; Nelma Moreira; Rogério Reis (DCFS, 2025)

Language Quotients Revisited. - Stavros Konstantinidis; Nelma Moreira; Rogério Reis (Int. J. Found. Comput. Sci., 2025)