Nelma Moreira - RankMe

135 papers A 1B 6C 26Misc 4Journal 61Unranked 28

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Average State Complexity of Partial Derivative Automata for Synchronised Shuffles. Int. J. Found. Comput. Sci. Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2025	—	`conf`	Automata for Synchronised Shuffle on Backbones. DCFS Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2025	J	`jnl`	Language Quotients Revisited. Int. J. Found. Comput. Sci. Stavros Konstantinidis, Nelma Moreira, Rogério Reis
2025	J	`jnl`	Preface: Celebrating Carlo's 60th Birthday. J. Autom. Lang. Comb. Martin Kutrib, Andreas Malcher, Nelma Moreira, Rogério Reis
2025	—	`ed.`	Proceedings of the 15th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2025, Loughborough University, July 21-22, 2025. NCMA Nelma Moreira, Luca Prigioniero
2025	—	`conf`	Two-Word Shuffle: Some Results. DCFS Guilherme Duarte, Nelma Moreira, Rogério Reis
2024	C	`conf`	Block Languages and Their Bitmap Representations. CIAA Guilherme Duarte, Nelma Moreira, Luca Prigioniero, Rogério Reis
2024	J	`jnl`	On the Representation of Block Languages. CoRR Guilherme Duarte, Nelma Moreira, Luca Prigioniero, Rogério Reis
2024	J	`jnl`	On the difference set of two transductions. Theor. Comput. Sci. Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Juraj Sebej
2024	—	`conf`	Operational State Complexity of Block Languages. NCMA Guilherme Duarte, Nelma Moreira, Luca Prigioniero, Rogério Reis
2023	J	`jnl`	Approximate NFA universality and related problems motivated by information theory. Theor. Comput. Sci. Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis
2023	C	`conf`	Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions. CIAA Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2023	J	`jnl`	Location automata for regular expressions with shuffle and intersection. Inf. Comput. Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2023	J	`jnl`	Location automata for synchronised shuffle expressions. J. Log. Algebraic Methods Program. Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2023	J	`jnl`	On the average complexity of partial derivative transducers. Theor. Comput. Sci. Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis
2023	J	`jnl`	Special Issue: 25th International Conference on Developments in Language Theory (DLT 2021) - Preface. Int. J. Found. Comput. Sci. Nelma Moreira, Rogério Reis
2022	—	`conf`	Approximate NFA Universality Motivated by Information Theory. DCFS Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis
2022	J	`jnl`	Approximate NFA Universality and Related Problems Motivated by Information Theory. CoRR Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis
2022	C	`conf`	Manipulation of Regular Expressions Using Derivatives: An Overview. CIAA Nelma Moreira, Rogério Reis
2021	C	`ed.`	Developments in Language Theory - 25th International Conference, DLT 2021, Porto, Portugal, August 16-20, 2021, Proceedings DLT Nelma Moreira, Rogério Reis
2021	—	`ch.`	Hot Current Topics of Descriptional Complexity. IFIP's Exciting First 60+ Years Martin Kutrib, Nelma Moreira, Giovanni Pighizzini, Rogério Reis
2021	C	`conf`	Location Based Automata for Expressions with Shuffle. LATA Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2021	—	`conf`	On the Uniform Distribution of Regular Expressions. DCFS Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2021	J	`jnl`	On the Uniform Distribution of Regular Expressions. CoRR Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2021	J	`jnl`	On the size of partial derivatives and the word membership problem. Acta Informatica Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis
2021	—	`conf`	Partial Derivative Automaton by Compressing Regular Expressions. DCFS Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis
2021	J	`jnl`	Partial derivatives of regular expressions over alphabet-invariant and user-defined labels. Theor. Comput. Sci. Stavros Konstantinidis, Nelma Moreira, Rogério Reis
2021	J	`jnl`	The Prefix Automaton. J. Autom. Lang. Comb. Sabine Broda, Eva Maia, Nelma Moreira, Rogério Reis
2020	—	`ed.`	Formal Methods. FM 2019 International Workshops - Porto, Portugal, October 7-11, 2019, Revised Selected Papers, Part I FM Workshops (1) Emil Sekerinski, Nelma Moreira, José N. Oliveira, Daniel Ratiu, Riccardo Guidotti, Marie Farrell, Matt Luckcuck, Diego Marmsoler, José Creissac Campos, Troy Astarte, Laure Gonnord, Antonio Cerone, Luis Couto, Brijesh Dongol, Martin Kutrib, Pedro Monteiro, David Delmas
2020	—	`ed.`	Formal Methods. FM 2019 International Workshops - Porto, Portugal, October 7-11, 2019, Revised Selected Papers, Part II FM Workshops (2) Emil Sekerinski, Nelma Moreira, José N. Oliveira, Daniel Ratiu, Riccardo Guidotti, Marie Farrell, Matt Luckcuck, Diego Marmsoler, José Creissac Campos, Troy Astarte, Laure Gonnord, Antonio Cerone, Luis Couto, Brijesh Dongol, Martin Kutrib, Pedro Monteiro, David Delmas
2020	J	`jnl`	Guest Column: Analytic Combinatorics and Descriptional Complexity of Regular Languages on Average. SIGACT News Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2020	B	`conf`	On the Average State Complexity of Partial Derivative Transducers. SOFSEM Stavros Konstantinidis, António Machiavelo, Nelma Moreira, Rogério Reis
2020	J	`jnl`	Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels. Int. J. Found. Comput. Sci. Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Joshua Young
2020	J	`jnl`	The computational power of parsing expression grammars. J. Comput. Syst. Sci. Bruno Loff, Nelma Moreira, Rogério Reis
2019	J	`jnl`	A mesh of automata. Inf. Comput. Sabine Broda, Markus Holzer, Eva Maia, Nelma Moreira, Rogério Reis
2019	J	`jnl`	On Average Behaviour of Regular Expressions in Strong Star Normal Form. Int. J. Found. Comput. Sci. Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2019	C	`conf`	Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels. CIAA Stavros Konstantinidis, Nelma Moreira, João Pires, Rogério Reis
2019	J	`jnl`	The computational power of parsing expression grammars. CoRR Bruno Loff, Nelma Moreira, Rogério Reis
2018	J	`jnl`	Automata for regular expressions with shuffle. Inf. Comput. Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2018	—	`conf`	Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs. DCFS Miguel Ferreira, Nelma Moreira, Rogério Reis
2018	J	`jnl`	Position Automata for Semi-extended Expressions. J. Autom. Lang. Comb. Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2018	J	`jnl`	Randomized generation of error control codes with automata and transducers. RAIRO Theor. Informatics Appl. Stavros Konstantinidis, Nelma Moreira, Rogério Reis
2018	C	`conf`	Regular Expressions and Transducers over Alphabet-Invariant and User-Defined Labels. CIAA Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Joshua Young
2018	J	`jnl`	Regular Expressions and Transducers over Alphabet-invariant and User-defined Labels. CoRR Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Joshua Young
2018	—	`conf`	Some Applications of the Formalization of the Pumping Lemma for Context-Free Languages. LSFA Marcus V. M. Ramos, José Carlos Bacelar Almeida, Nelma Moreira, Ruy J. G. B. de Queiroz
2018	J	`jnl`	Symbolic Manipulation of Code Properties. J. Autom. Lang. Comb. Stavros Konstantinidis, Casey Meijer, Nelma Moreira, Rogério Reis
2018	C	`conf`	The Computational Power of Parsing Expression Grammars. DLT Bruno Loff, Nelma Moreira, Rogério Reis
2017	J	`jnl`	A Survey on Operational State Complexity. J. Autom. Lang. Comb. Yuan Gao, Nelma Moreira, Rogério Reis, Sheng Yu
2017	J	`jnl`	On the Average Complexity of Partial Derivative Automata for Semi-extended Expressions. J. Autom. Lang. Comb. Rafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2017	—	`conf`	On the Average Complexity of Strong Star Normal Form. DCFS Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2017	C	`conf`	On the Mother of All Automata: The Position Automaton. DLT Sabine Broda, Markus Holzer, Eva Maia, Nelma Moreira, Rogério Reis
2017	J	`jnl`	Optimal state reductions of automata with partially specified behaviors. Theor. Comput. Sci. Nelma Moreira, Giovanni Pighizzini, Rogério Reis
2017	—	`ed.`	The Role of Theory in Computer Science - Essays Dedicated to Janusz Brzozowski Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Jeffrey O. Shallit
2016	—	`conf`	Automata Serialization for Manipulation and Drawing. SLATE Miguel Ferreira, Nelma Moreira, Rogério Reis
2016	J	`jnl`	Channels with Synchronization/Substitution Errors and Computation of Error Control Codes. CoRR Stavros Konstantinidis, Nelma Moreira, Rogério Reis
2016	J	`jnl`	Distinguishability Operations and Closures. Fundam. Informaticae Cezar Câmpeanu, Nelma Moreira, Rogério Reis
2016	J	`jnl`	Formalization of the pumping lemma for context-free languages. J. Formaliz. Reason. Marcus Vinícius Midena Ramos, José Carlos Bacelar Almeida, Nelma Moreira, Ruy José Guerra Barretto de Queiroz
2016	—	`conf`	Generating error control codes with automata and transducers. NCMA Stavros Konstantinidis, Nelma Moreira, Rogério Reis
2016	C	`conf`	Implementation of Code Properties via Transducers. CIAA Stavros Konstantinidis, Casey Meijer, Nelma Moreira, Rogério Reis
2016	C	`conf`	On the Formalization of Some Results of Context-Free Language Theory. WoLLIC Marcus Vinícius Midena Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira, José Carlos Bacelar Almeida
2016	—	`conf`	On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection. DCFS Rafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2016	—	`conf`	On the dissimilarity operation on finite languages. NCMA Cezar Câmpeanu, Nelma Moreira, Rogério Reis
2016	C	`conf`	Position Automaton Construction for Regular Expressions with Intersection. DLT Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2015	J	`jnl`	A Survey on Operational State Complexity. CoRR Yuan Gao, Nelma Moreira, Rogério Reis, Sheng Yu
2015	J	`jnl`	Average Size of Automata Constructions from Regular Expressions. Bull. EATCS Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2015	J	`jnl`	Deciding Kleene algebra terms equivalence in Coq. J. Log. Algebraic Methods Program. Nelma Moreira, David Pereira, Simão Melo de Sousa
2015	C	`conf`	Deciding Synchronous Kleene Algebra with Derivatives. CIAA Sabine Broda, Sílvia Cavadas, Miguel Ferreira, Nelma Moreira
2015	J	`jnl`	Formalization of context-free language theory. CoRR Marcus V. M. Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira, José Carlos Bacelar Almeida
2015	J	`jnl`	Formalization of the pumping lemma for context-free languages. CoRR Marcus Vinícius Midena Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira, José Carlos Bacelar Almeida
2015	J	`jnl`	Incomplete operational transition complexity of regular languages. Inf. Comput. Eva Maia, Nelma Moreira, Rogério Reis
2015	B	`conf`	Optimal State Reductions of Automata with Partially Specified Behaviors. SOFSEM Nelma Moreira, Giovanni Pighizzini, Rogério Reis
2015	—	`conf`	Partial Derivative Automaton for Regular Expressions with Shuffle. DCFS Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2015	J	`jnl`	Partial Derivative Automaton for Regular Expressions with Shuffle. CoRR Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2015	C	`conf`	Prefix and Right-Partial Derivative Automata. CiE Eva Maia, Nelma Moreira, Rogério Reis
2015	—	`ed.`	Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31 - September 1, 2015. Proceedings NCMA Rudolf Freund, Markus Holzer, Nelma Moreira, Rogério Reis
2015	J	`jnl`	Symbolic Manipulation of Code Properties. CoRR Stavros Konstantinidis, Casey Meijer, Nelma Moreira, Rogério Reis
2015	—	`conf`	Universal Disjunctive Concatenation and Star. DCFS Nelma Moreira, Giovanni Pighizzini, Rogério Reis
2014	J	`jnl`	A Hitchhiker's Guide to descriptional complexity through analytic combinatorics. Theor. Comput. Sci. Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2014	J	`jnl`	Incremental DFA minimisation. RAIRO Theor. Informatics Appl. Marco Almeida, Nelma Moreira, Rogério Reis
2014	C	`conf`	On the Equivalence of Automata for KAT-expressions. CiE Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2014	C	`conf`	Partial Derivative and Position Bisimilarity Automata. CIAA Eva Maia, Nelma Moreira, Rogério Reis
2014	—	`conf`	Symmetric Groups and Quotient Complexity of Boolean Operations. ICALP (2) Jason P. Bell, Janusz A. Brzozowski, Nelma Moreira, Rogério Reis
2014	J	`jnl`	The Distinguishability Operation On Regular Languages. CoRR Cezar Câmpeanu, Nelma Moreira, Rogério Reis
2014	—	`conf`	The distinguishability operation on regular languages. NCMA Cezar Câmpeanu, Nelma Moreira, Rogério Reis
2013	J	`jnl`	Incomplete Transition Complexity of Basic Operations on Finite Languages CoRR Eva Maia, Nelma Moreira, Rogério Reis
2013	C	`conf`	Incomplete Transition Complexity of Basic Operations on Finite Languages. CIAA Eva Maia, Nelma Moreira, Rogério Reis
2013	B	`conf`	Incomplete Transition Complexity of Some Basic Operations. SOFSEM Eva Maia, Nelma Moreira, Rogério Reis
2013	B	`conf`	On the Average Size of Glushkov and Equation Automata for KAT Expressions. FCT Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2013	J	`jnl`	Preface. Int. J. Found. Comput. Sci. Nelma Moreira, Rogério Reis
2013	J	`jnl`	Symmetric Groups and Quotient Complexity of Boolean Operations. CoRR Jason P. Bell, Janusz A. Brzozowski, Nelma Moreira, Rogério Reis
2012	—	`conf`	Deciding KAT and Hoare Logic with Derivatives GandALF Ricardo Almeida, Sabine Broda, Nelma Moreira
2012	C	`conf`	Deciding Regular Expressions (In-)Equivalence in Coq. RAMiCS Nelma Moreira, David Pereira, Simão Melo de Sousa
2012	—	`ed.`	Descriptional Complexity of Formal Systems - 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings DCFS Martin Kutrib, Nelma Moreira, Rogério Reis
2012	J	`jnl`	Editorial. J. Autom. Lang. Comb. Jürgen Dassow, Martin Kutrib, Nelma Moreira, Rogério Reis
2012	—	`ch.`	Finite Automata Minimization. Handbook of Finite State Based Models and Applications Marco Almeida, Nelma Moreira, Rogério Reis
2012	C	`ed.`	Implementation and Application of Automata - 17th International Conference, CIAA 2012, Porto, Portugal, July 17-20, 2012. Proceedings CIAA Nelma Moreira, Rogério Reis
2012	J	`jnl`	On the Average Size of Glushkov and Partial derivative Automata. Int. J. Found. Comput. Sci. Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2011	J	`jnl`	On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach. Int. J. Found. Comput. Sci. Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2011	C	`conf`	The Average Transition Complexity of Glushkov and Partial Derivative Automata. Developments in Language Theory Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2010	C	`conf`	Incremental DFA Minimisation. CIAA Marco Almeida, Nelma Moreira, Rogério Reis
2010	C	`conf`	On the Average Number of States of Partial Derivative Automata. Developments in Language Theory Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2010	C	`conf`	Partial Derivative Automata Formalized in Coq. CIAA José Bacelar Almeida, Nelma Moreira, David Pereira, Simão Melo de Sousa
2010	J	`jnl`	Small NFAs from Regular Expressions: Some Experimental Results CoRR Hugo Gouveia, Nelma Moreira, Rogério Reis
2010	—	`conf`	State Elimination Ordering Strategies: Some Experimental Results DCFS Nelma Moreira, Davide Nabais, Rogério Reis
2010	J	`jnl`	Testing the Equivalence of Regular Languages. J. Autom. Lang. Comb. Marco Almeida, Nelma Moreira, Rogério Reis
2009	J	`jnl`	Antimirov and Mosses's Rewrite System Revisited. Int. J. Found. Comput. Sci. Marco Almeida, Nelma Moreira, Rogério Reis
2009	J	`jnl`	Aspects of enumeration and generation with a string automata representation CoRR Marco Almeida, Nelma Moreira, Rogério Reis
2009	J	`jnl`	Exact generation of acyclic deterministic finite automata CoRR Marco Almeida, Nelma Moreira, Rogério Reis
2009	C	`conf`	FAdo and GUItar. CIAA André Almeida, Marco Almeida, José Alves, Nelma Moreira, Rogério Reis
2009	J	`jnl`	On the Representation of Finite Automata CoRR Rogério Reis, Nelma Moreira, Marco Almeida
2009	J	`jnl`	Series-Parallel Automata and Short Regular Expressions. Fundam. Informaticae Nelma Moreira, Rogério Reis
2009	—	`conf`	Testing the Equivalence of Regular Languages DCFS Marco Almeida, Nelma Moreira, Rogério Reis
2008	C	`conf`	Antimirov and Mosses's Rewrite System Revisited. CIAA Marco Almeida, Nelma Moreira, Rogério Reis
2008	—	`conf`	Exact Generation of Acyclic Deterministic Finite Automata. DCFS Marco Almeida, Nelma Moreira, Rogério Reis
2008	J	`jnl`	Exact Generation of Minimal Acyclic Deterministic Finite Automata. Int. J. Found. Comput. Sci. Marco Almeida, Nelma Moreira, Rogério Reis
2008	J	`jnl`	KAT and PHL in Coq. Comput. Sci. Inf. Syst. David Pereira, Nelma Moreira
2007	J	`jnl`	Enumeration and generation with a string automata representation. Theor. Comput. Sci. Marco Almeida, Nelma Moreira, Rogério Reis
2007	—	`conf`	Exact Generation of Minimal Acyclic Deterministic Finite Automata. DCFS Marco Almeida, Nelma Moreira, Rogério Reis
2007	—	`conf`	Formal Modelling of Emotions in BDI Agents. CLIMA David Pereira, Eugénio C. Oliveira, Nelma Moreira
2006	—	`conf`	Aspects of Enumeration and Generation with a String Automata Representation. DCFS Marco Almeida, Nelma Moreira, Rogério Reis
2006	Misc	`conf`	Designing a Solver for Arithmetic Constraints to Support Education in Mathematics. AIAI Ana Paula Tomás, Nelma Moreira, Nuno Pereira
2005	C	`conf`	Acyclic Automata with Easy-to-Find Short Regular Expressions. CIAA José João Morais, Nelma Moreira, Rogério Reis
2005	B	`conf`	Interactive manipulation of regular objects with FAdo. ITiCSE Nelma Moreira, Rogério Reis
2005	—	`conf`	On the Representation of Finite Automata. DCFS Rogério Reis, Nelma Moreira, Marco Almeida
2001	J	`jnl`	Apoo: an environment for a first course in assembly language programming. ACM SIGCSE Bull. Rogério Reis, Nelma Moreira
1995	J	`jnl`	Constraint Categorial Grammars CoRR Luís Damas, Nelma Moreira
1995	Misc	`conf`	Constraint Categorial Grammars. EPIA Luís Damas, Nelma Moreira
1993	Misc	`conf`	Resolution of Constraints in Algebras of Rational Trees. EPIA Luís Damas, Nelma Moreira, Sabine Broda
1991	—	`conf`	An History Based Interface. LPE José Paulo Leal, Luís Damas, Nelma Moreira
1991	—	`ed.`	Natural Language Processing, EAIA '90, 2nd Advanced School in Artificial Intelligence, Guarda, Portugal, October 8-12, 1990, Proceedings EAIA Miguel Filgueiras, Luís Damas, Nelma Moreira, Ana Paula Tomás
1991	A	`conf`	The Formal and Processing Models of CLG. EACL Luís Damas, Giovanni B. Varile, Nelma Moreira
1990	B	`conf`	CLG(n): Constraint Logic Grammars. COLING Sergio Balari, Giovanni B. Varile, Luís Damas, Nelma Moreira
1990	—	`conf`	General Introduction. EAIA Miguel Filgueiras, Nelma Moreira, Ana Paula Tomás
1990	—	`conf`	Natural Language and Natural Menus Interfaces. Modelling the Innovation Miguel Filgueiras, Ana Paula Tomás, Nelma Moreira, Rogério Reis, José Paulo Leal
1989	Misc	`conf`	Semantic Analysis of Time and Tense in Natural Language: An Implementation. EPIA Nelma Moreira