Nelma Moreira

From MaRDI portal
Person:498391

Available identifiers

zbMath Open moreira.nelmaMaRDI QIDQ498391

List of research outcomes





PublicationDate of PublicationType
Block languages and their bitmap representations2025-01-20Paper
On the difference set of two transductions2024-10-07Paper
Average complexity of partial derivatives for synchronised shuffle expressions2024-02-28Paper
Location automata for regular expressions with shuffle and intersection2024-02-02Paper
Approximate NFA universality and related problems motivated by information theory2023-09-07Paper
On the average complexity of partial derivative transducers2023-04-26Paper
Location automata for synchronised shuffle expressions2023-03-20Paper
Approximate NFA universality motivated by information theory2023-01-18Paper
On the uniform distribution of regular expressions2022-11-09Paper
Partial derivative automaton by compressing regular expressions2022-11-09Paper
Manipulation of regular expressions using derivatives: an overview2022-08-16Paper
https://portal.mardi4nfdi.de/entity/Q50615152022-03-11Paper
Location based automata for expressions with shuffle2021-10-04Paper
On the size of partial derivatives and the word membership problem2021-07-23Paper
Partial derivatives of regular expressions over alphabet-invariant and user-defined labels2021-06-03Paper
https://portal.mardi4nfdi.de/entity/Q49865102021-04-27Paper
Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels2021-04-19Paper
https://portal.mardi4nfdi.de/entity/Q49640202021-02-24Paper
https://portal.mardi4nfdi.de/entity/Q51465142021-01-26Paper
On the Average State Complexity of Partial Derivative Transducers2020-07-20Paper
Partial derivatives of regular expressions over alphabet-invariant and user-defined labels2020-05-06Paper
The computational power of parsing expression grammars2020-03-26Paper
On Average Behaviour of Regular Expressions in Strong Star Normal Form2019-12-10Paper
Some applications of the formalization of the pumping lemma for context-free languages2019-11-13Paper
Formalization of the pumping lemma for context-free languages2019-09-18Paper
A mesh of automata2019-09-17Paper
Randomized generation of error control codes with automata and transducers2019-07-18Paper
https://portal.mardi4nfdi.de/entity/Q49671842019-07-03Paper
The computational power of parsing expression grammars2018-11-22Paper
Regular expressions and transducers over alphabet-invariant and user-defined labels2018-11-07Paper
https://portal.mardi4nfdi.de/entity/Q53763392018-09-17Paper
https://portal.mardi4nfdi.de/entity/Q53763302018-09-17Paper
https://portal.mardi4nfdi.de/entity/Q46093262018-03-29Paper
Automata for regular expressions with shuffle2018-03-21Paper
https://portal.mardi4nfdi.de/entity/Q45909102017-11-20Paper
Distinguishability Operations and Closures2017-11-09Paper
On the mother of all automata: the position automaton2017-10-13Paper
On the average complexity of strong star normal form2017-08-31Paper
Optimal state reductions of automata with partially specified behaviors2016-12-19Paper
On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection2016-11-09Paper
Implementation of Code Properties via Transducers2016-11-09Paper
Testing the equivalence of regular languages2016-09-29Paper
On the Formalization of Some Results of Context-Free Language Theory2016-09-09Paper
Position Automaton Construction for Regular Expressions with Intersection2016-08-30Paper
Prefix and Right-Partial Derivative Automata2015-10-20Paper
Incomplete operational transition complexity of regular languages2015-09-28Paper
Universal Disjunctive Concatenation and Star2015-08-07Paper
Partial Derivative Automaton for Regular Expressions with Shuffle2015-08-07Paper
Deciding Kleene algebra terms equivalence in Coq2015-06-10Paper
On the Equivalence of Automata for KAT-expressions2015-02-25Paper
Optimal State Reductions of Automata with Partially Specified Behaviors2015-02-20Paper
Incomplete Transition Complexity of Some Basic Operations2014-11-04Paper
Partial Derivative and Position Bisimilarity Automata2014-09-26Paper
Symmetric Groups and Quotient Complexity of Boolean Operations2014-07-01Paper
Incremental DFA minimisation2014-06-27Paper
https://portal.mardi4nfdi.de/entity/Q54182522014-06-03Paper
A hitchhiker's guide to descriptional complexity through analytic combinatorics2014-03-13Paper
On the Average Size of Glushkov and Equation Automata for KAT Expressions2013-08-16Paper
Incomplete Transition Complexity of Basic Operations on Finite Languages2013-08-07Paper
ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA2013-01-18Paper
Deciding Regular Expressions (In-)Equivalence in Coq2012-09-21Paper
On the average state complexity of partial derivative automata: an analytic combinatorics approach2012-08-29Paper
The Average Transition Complexity of Glushkov and Partial Derivative Automata2011-07-29Paper
Incremental DFA Minimisation2011-02-11Paper
Partial Derivative Automata Formalized in Coq2011-02-11Paper
On the Average Number of States of Partial Derivative Automata2010-08-31Paper
ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED2009-08-21Paper
Series-Parallel Automata and Short Regular Expressions2009-06-23Paper
Formal Modelling of Emotions in BDI Agents2009-02-12Paper
Antimirov and Mosses’s Rewrite System Revisited2009-02-12Paper
EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA2008-09-25Paper
Enumeration and generation with a string automata representation2007-12-19Paper
Implementation and Application of Automata2006-11-13Paper
https://portal.mardi4nfdi.de/entity/Q30240292005-07-11Paper

Research outcomes over time

This page was built for person: Nelma Moreira