Nelma Moreira

ORCID

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 62

Top Venues

CoRR

DCFS

CIAA

J. Autom. Lang. Comb.

Publications

Guilherme Duarte, Nelma Moreira, Luca Prigioniero, Rogério Reis
On the Representation of Block Languages. CoRR (2024)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions. CIAA (2023)
Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis
On the average complexity of partial derivative transducers. Theor. Comput. Sci. 956 (2023)
Nelma Moreira, Rogéxrio Reis
Special Issue: 25th International Conference on Developments in Language Theory (DLT 2021) - Preface. Int. J. Found. Comput. Sci. 34 (2&3) (2023)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
Location automata for synchronised shuffle expressions. J. Log. Algebraic Methods Program. 132 (2023)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
Location automata for regular expressions with shuffle and intersection. Inf. Comput. 295 (Part B) (2023)
Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis
Approximate NFA universality and related problems motivated by information theory. Theor. Comput. Sci. 972 (2023)
Nelma Moreira, Rogério Reis
Manipulation of Regular Expressions Using Derivatives: An Overview. CIAA (2022)
Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis
Approximate NFA Universality Motivated by Information Theory. DCFS (2022)
Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis
Approximate NFA Universality and Related Problems Motivated by Information Theory. CoRR (2022)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
Location Based Automata for Expressions with Shuffle. LATA (2021)
Sabine Broda, Eva Maia, Nelma Moreira, Rogério Reis
The Prefix Automaton. J. Autom. Lang. Comb. 26 (1-2) (2021)
Stavros Konstantinidis, Nelma Moreira, Rogério Reis
Partial derivatives of regular expressions over alphabet-invariant and user-defined labels. Theor. Comput. Sci. 870 (2021)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
On the Uniform Distribution of Regular Expressions. DCFS (2021)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
On the Uniform Distribution of Regular Expressions. CoRR (2021)
Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis
Partial Derivative Automaton by Compressing Regular Expressions. DCFS (2021)
Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis
On the size of partial derivatives and the word membership problem. Acta Informatica 58 (4) (2021)
Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Joshua Young
Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels. Int. J. Found. Comput. Sci. 31 (8) (2020)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
Guest Column: Analytic Combinatorics and Descriptional Complexity of Regular Languages on Average. SIGACT News 51 (1) (2020)
Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis
On the Average State Complexity of Partial Derivative Transducers. SOFSEM (2020)
Bruno Loff, Nelma Moreira, Rogério Reis
The computational power of parsing expression grammars. J. Comput. Syst. Sci. 111 (2020)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
On Average Behaviour of Regular Expressions in Strong Star Normal Form. Int. J. Found. Comput. Sci. 30 (6-7) (2019)
Sabine Broda, Markus Holzer, Eva Maia, Nelma Moreira, Rogério Reis
A mesh of automata. Inf. Comput. 265 (2019)
Bruno Loff, Nelma Moreira, Rogério Reis
The computational power of parsing expression grammars. CoRR (2019)
Stavros Konstantinidis, Nelma Moreira, João Pires, Rogério Reis
Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels. CIAA (2019)
Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Joshua Young
Regular Expressions and Transducers over Alphabet-Invariant and User-Defined Labels. CIAA (2018)
Marcus V. M. Ramos, José Carlos Bacelar Almeida, Nelma Moreira, Ruy J. G. B. de Queiroz
Some Applications of the Formalization of the Pumping Lemma for Context-Free Languages. LSFA (2018)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
Position Automata for Semi-extended Expressions. J. Autom. Lang. Comb. 23 (1-3) (2018)
Stavros Konstantinidis, Nelma Moreira, Rogério Reis
Randomized generation of error control codes with automata and transducers. RAIRO Theor. Informatics Appl. 52 (2-3-4) (2018)
Bruno Loff, Nelma Moreira, Rogério Reis
The Computational Power of Parsing Expression Grammars. DLT (2018)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
Automata for regular expressions with shuffle. Inf. Comput. 259 (2) (2018)
Miguel Ferreira, Nelma Moreira, Rogério Reis
Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs. DCFS (2018)
Stavros Konstantinidis, Casey Meijer, Nelma Moreira, Rogério Reis
Symbolic Manipulation of Code Properties. J. Autom. Lang. Comb. 23 (1-3) (2018)
Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Joshua Young
Regular Expressions and Transducers over Alphabet-invariant and User-defined Labels. CoRR (2018)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
On the Average Complexity of Strong Star Normal Form. DCFS (2017)
Nelma Moreira, Giovanni Pighizzini, Rogério Reis
Optimal state reductions of automata with partially specified behaviors. Theor. Comput. Sci. 658 (2017)
Sabine Broda, Markus Holzer, Eva Maia, Nelma Moreira, Rogério Reis
On the Mother of All Automata: The Position Automaton. DLT (2017)
Yuan Gao, Nelma Moreira, Rogério Reis, Sheng Yu
A Survey on Operational State Complexity. J. Autom. Lang. Comb. 21 (4) (2017)
Rafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
On the Average Complexity of Partial Derivative Automata for Semi-extended Expressions. J. Autom. Lang. Comb. 22 (1-3) (2017)
Stavros Konstantinidis, Casey Meijer, Nelma Moreira, Rogério Reis
Implementation of Code Properties via Transducers. CIAA (2016)
Marcus Vinícius Midena Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira, José Carlos Bacelar Almeida
On the Formalization of Some Results of Context-Free Language Theory. WoLLIC (2016)
Miguel Ferreira, Nelma Moreira, Rogério Reis
Automata Serialization for Manipulation and Drawing. SLATE (2016)
Marcus Vinícius Midena Ramos, José Carlos Bacelar Almeida, Nelma Moreira, Ruy José Guerra Barretto de Queiroz
Formalization of the pumping lemma for context-free languages. J. Formaliz. Reason. 9 (2) (2016)
Stavros Konstantinidis, Nelma Moreira, Rogério Reis
Channels with Synchronization/Substitution Errors and Computation of Error Control Codes. CoRR (2016)
Stavros Konstantinidis, Nelma Moreira, Rogério Reis
Generating error control codes with automata and transducers. NCMA (2016)
Cezar Câmpeanu, Nelma Moreira, Rogério Reis
Distinguishability Operations and Closures. Fundam. Informaticae 148 (3-4) (2016)
Cezar Câmpeanu, Nelma Moreira, Rogério Reis
On the dissimilarity operation on finite languages. NCMA (2016)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
Position Automaton Construction for Regular Expressions with Intersection. DLT (2016)
Rafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection. DCFS (2016)
Stavros Konstantinidis, Casey Meijer, Nelma Moreira, Rogério Reis
Symbolic Manipulation of Code Properties. CoRR (2015)
Eva Maia, Nelma Moreira, Rogério Reis
Incomplete operational transition complexity of regular languages. Inf. Comput. 244 (2015)
Sabine Broda, Sílvia Cavadas, Miguel Ferreira, Nelma Moreira
Deciding Synchronous Kleene Algebra with Derivatives. CIAA (2015)
Nelma Moreira, Giovanni Pighizzini, Rogério Reis
Universal Disjunctive Concatenation and Star. DCFS (2015)
Nelma Moreira, David Pereira, Simão Melo de Sousa
Deciding Kleene algebra terms equivalence in Coq. J. Log. Algebraic Methods Program. 84 (3) (2015)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
Partial Derivative Automaton for Regular Expressions with Shuffle. DCFS (2015)
Yuan Gao, Nelma Moreira, Rogério Reis, Sheng Yu
A Survey on Operational State Complexity. CoRR (2015)
Nelma Moreira, Giovanni Pighizzini, Rogério Reis
Optimal State Reductions of Automata with Partially Specified Behaviors. SOFSEM (2015)
Eva Maia, Nelma Moreira, Rogério Reis
Prefix and Right-Partial Derivative Automata. CiE (2015)
Marcus V. M. Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira, José Carlos Bacelar Almeida
Formalization of context-free language theory. CoRR (2015)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
Partial Derivative Automaton for Regular Expressions with Shuffle. CoRR (2015)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
Average Size of Automata Constructions from Regular Expressions. Bull. EATCS 116 (2015)
Marcus Vinícius Midena Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira, José Carlos Bacelar Almeida
Formalization of the pumping lemma for context-free languages. CoRR (2015)
Marco Almeida, Nelma Moreira, Rogério Reis
Incremental DFA minimisation. RAIRO Theor. Informatics Appl. 48 (2) (2014)
Cezar Câmpeanu, Nelma Moreira, Rogério Reis
The distinguishability operation on regular languages. NCMA (2014)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
A Hitchhiker's Guide to descriptional complexity through analytic combinatorics. Theor. Comput. Sci. 528 (2014)
Jason P. Bell, Janusz A. Brzozowski, Nelma Moreira, Rogério Reis
Symmetric Groups and Quotient Complexity of Boolean Operations. ICALP (2) (2014)
Eva Maia, Nelma Moreira, Rogério Reis
Partial Derivative and Position Bisimilarity Automata. CIAA (2014)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
On the Equivalence of Automata for KAT-expressions. CiE (2014)
Cezar Câmpeanu, Nelma Moreira, Rogério Reis
The Distinguishability Operation On Regular Languages. CoRR (2014)
Nelma Moreira, Rogério Reis
Preface. Int. J. Found. Comput. Sci. 24 (6) (2013)
Eva Maia, Nelma Moreira, Rogério Reis
Incomplete Transition Complexity of Basic Operations on Finite Languages CoRR (2013)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
On the Average Size of Glushkov and Equation Automata for KAT Expressions. FCT (2013)
Eva Maia, Nelma Moreira, Rogério Reis
Incomplete Transition Complexity of Some Basic Operations. SOFSEM (2013)
Jason P. Bell, Janusz A. Brzozowski, Nelma Moreira, Rogério Reis
Symmetric Groups and Quotient Complexity of Boolean Operations. CoRR (2013)
Eva Maia, Nelma Moreira, Rogério Reis
Incomplete Transition Complexity of Basic Operations on Finite Languages. CIAA (2013)
Jürgen Dassow, Martin Kutrib, Nelma Moreira, Rogério Reis
Editorial. J. Autom. Lang. Comb. 17 (2-4) (2012)
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) (2012)
Nelma Moreira, David Pereira, Simão Melo de Sousa
Deciding Regular Expressions (In-)Equivalence in Coq. RAMiCS (2012)
Ricardo Almeida, Sabine Broda, Nelma Moreira
Deciding KAT and Hoare Logic with Derivatives GandALF (2012)
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)
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) (2011)
Marco Almeida, Nelma Moreira, Rogério Reis
Incremental DFA Minimisation. CIAA (2010)
Nelma Moreira, Davide Nabais, Rogério Reis
State Elimination Ordering Strategies: Some Experimental Results DCFS (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)
Marco Almeida, Nelma Moreira, Rogério Reis
Testing the Equivalence of Regular Languages. J. Autom. Lang. Comb. 15 (1/2) (2010)
José Bacelar Almeida, Nelma Moreira, David Pereira, Simão Melo de Sousa
Partial Derivative Automata Formalized in Coq. CIAA (2010)
Hugo Gouveia, Nelma Moreira, Rogério Reis
Small NFAs from Regular Expressions: Some Experimental Results CoRR (2010)
Rogério Reis, Nelma Moreira, Marco Almeida
On the Representation of Finite Automata CoRR (2009)
Marco Almeida, Nelma Moreira, Rogério Reis
Aspects of enumeration and generation with a string automata representation CoRR (2009)
Marco Almeida, Nelma Moreira, Rogério Reis
Testing the Equivalence of Regular Languages DCFS (2009)
Marco Almeida, Nelma Moreira, Rogério Reis
Exact generation of acyclic deterministic finite automata CoRR (2009)
Marco Almeida, Nelma Moreira, Rogério Reis
Antimirov and Mosses's Rewrite System Revisited. Int. J. Found. Comput. Sci. 20 (4) (2009)
Nelma Moreira, Rogério Reis
Series-Parallel Automata and Short Regular Expressions. Fundam. Informaticae 91 (3-4) (2009)
André Almeida, Marco Almeida, José Alves, Nelma Moreira, Rogério Reis
FAdo and GUItar. CIAA (2009)
Marco Almeida, Nelma Moreira, Rogério Reis
Exact Generation of Acyclic Deterministic Finite Automata. DCFS (2008)
David Pereira, Nelma Moreira
KAT and PHL in Coq. Comput. Sci. Inf. Syst. 5 (2) (2008)
Marco Almeida, Nelma Moreira, Rogério Reis
Exact Generation of Minimal Acyclic Deterministic Finite Automata. Int. J. Found. Comput. Sci. 19 (4) (2008)
Marco Almeida, Nelma Moreira, Rogério Reis
Antimirov and Mosses's Rewrite System Revisited. CIAA (2008)
Marco Almeida, Nelma Moreira, Rogério Reis
Enumeration and generation with a string automata representation. Theor. Comput. Sci. 387 (2) (2007)
David Pereira, Eugénio C. Oliveira, Nelma Moreira
Formal Modelling of Emotions in BDI Agents. CLIMA (2007)

Nelma Moreira.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nelma Moreira