Nelma Moreira

According to our database1, Nelma Moreira authored at least 79 papers between 1989 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
On the Average State Complexity of Partial Derivative Transducers.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019
On Average Behaviour of Regular Expressions in Strong Star Normal Form.
Int. J. Found. Comput. Sci., 2019

A mesh of automata.
Inf. Comput., 2019

Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels.
Proceedings of the Implementation and Application of Automata, 2019

2018
Symbolic Manipulation of Code Properties.
Journal of Automata, Languages and Combinatorics, 2018

Position Automata for Semi-extended Expressions.
Journal of Automata, Languages and Combinatorics, 2018

Randomized generation of error control codes with automata and transducers.
RAIRO - Theor. Inf. and Applic., 2018

Automata for regular expressions with shuffle.
Inf. Comput., 2018

Some Applications of the Formalization of the Pumping Lemma for Context-Free Languages.
Proceedings of the 13th Workshop on Logical and Semantic Frameworks with Applications, 2018

Regular Expressions and Transducers over Alphabet-Invariant and User-Defined Labels.
Proceedings of the Implementation and Application of Automata, 2018

The Computational Power of Parsing Expression Grammars.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs.
Proceedings of the Descriptional Complexity of Formal Systems, 2018

2017
Optimal state reductions of automata with partially specified behaviors.
Theor. Comput. Sci., 2017

A Survey on Operational State Complexity.
Journal of Automata, Languages and Combinatorics, 2017

On the Average Complexity of Partial Derivative Automata for Semi-extended Expressions.
Journal of Automata, Languages and Combinatorics, 2017

On the Mother of All Automata: The Position Automaton.
Proceedings of the Developments in Language Theory - 21st International Conference, 2017

On the Average Complexity of Strong Star Normal Form.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016
Formalization of the pumping lemma for context-free languages.
J. Formalized Reasoning, 2016

Distinguishability Operations and Closures.
Fundam. Inform., 2016

Channels with Synchronization/Substitution Errors and Computation of Error Control Codes.
CoRR, 2016

On the Formalization of Some Results of Context-Free Language Theory.
Proceedings of the Logic, Language, Information, and Computation, 2016

Implementation of Code Properties via Transducers.
Proceedings of the Implementation and Application of Automata, 2016

Automata Serialization for Manipulation and Drawing.
Proceedings of the 5th Symposium on Languages, Applications and Technologies, 2016

Generating error control codes with automata and transducers.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

On the dissimilarity operation on finite languages.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

Position Automaton Construction for Regular Expressions with Intersection.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection.
Proceedings of the Descriptional Complexity of Formal Systems, 2016

2015
Deciding Kleene algebra terms equivalence in Coq.
J. Log. Algebraic Methods Program., 2015

Incomplete operational transition complexity of regular languages.
Inf. Comput., 2015

Average Size of Automata Constructions from Regular Expressions.
Bulletin of the EATCS, 2015

Formalization of context-free language theory.
CoRR, 2015

Deciding Synchronous Kleene Algebra with Derivatives.
Proceedings of the Implementation and Application of Automata, 2015

Universal Disjunctive Concatenation and Star.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

Partial Derivative Automaton for Regular Expressions with Shuffle.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

Prefix and Right-Partial Derivative Automata.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014
A Hitchhiker's Guide to descriptional complexity through analytic combinatorics.
Theor. Comput. Sci., 2014

Incremental DFA minimisation.
RAIRO - Theor. Inf. and Applic., 2014

Partial Derivative and Position Bisimilarity Automata.
Proceedings of the Implementation and Application of Automata, 2014

The distinguishability operation on regular languages.
Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

Symmetric Groups and Quotient Complexity of Boolean Operations.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

On the Equivalence of Automata for KAT-expressions.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013
Preface.
Int. J. Found. Comput. Sci., 2013

Incomplete Transition Complexity of Basic Operations on Finite Languages.
Proceedings of the Implementation and Application of Automata, 2013

Incomplete Transition Complexity of Some Basic Operations.
Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

On the Average Size of Glushkov and Equation Automata for KAT Expressions.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

2012
Finite Automata Minimization.
Proceedings of the Handbook of Finite State Based Models and Applications., 2012

Editorial.
Journal of Automata, Languages and Combinatorics, 2012

On the Average Size of Glushkov and Partial derivative Automata.
Int. J. Found. Comput. Sci., 2012

Deciding KAT and Hoare Logic with Derivatives
Proceedings of the Proceedings Third International Symposium on Games, 2012

Deciding Regular Expressions (In-)Equivalence in Coq.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2012

2011
On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach.
Int. J. Found. Comput. Sci., 2011

The Average Transition Complexity of Glushkov and Partial Derivative Automata.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010
Testing the Equivalence of Regular Languages.
Journal of Automata, Languages and Combinatorics, 2010

Small NFAs from Regular Expressions: Some Experimental Results
CoRR, 2010

State Elimination Ordering Strategies: Some Experimental Results
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Partial Derivative Automata Formalized in Coq.
Proceedings of the Implementation and Application of Automata, 2010

On the Average Number of States of Partial Derivative Automata.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
Antimirov and Mosses's Rewrite System Revisited.
Int. J. Found. Comput. Sci., 2009

Series-Parallel Automata and Short Regular Expressions.
Fundam. Inform., 2009

FAdo and GUItar.
Proceedings of the Implementation and Application of Automata, 2009

2008
Exact Generation of Minimal Acyclic Deterministic Finite Automata.
Int. J. Found. Comput. Sci., 2008

KAT and PHL in Coq.
Comput. Sci. Inf. Syst., 2008

Exact Generation of Acyclic Deterministic Finite Automata.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007
Enumeration and generation with a string automata representation.
Theor. Comput. Sci., 2007

Formal Modelling of Emotions in BDI Agents.
Proceedings of the Computational Logic in Multi-Agent Systems, 8th International Workshop, 2007

2006
Designing a Solver for Arithmetic Constraints to Support Education in Mathematics.
Proceedings of the Artificial Intelligence Applications and Innovations, 2006

Aspects of Enumeration and Generation with a String Automata Representation.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2005
Acyclic Automata with Easy-to-Find Short Regular Expressions.
Proceedings of the Implementation and Application of Automata, 2005

Interactive manipulation of regular objects with FAdo.
Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2005

On the Representation of Finite Automata.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2001
Apoo: an environment for a first course in assembly language programming.
SIGCSE Bulletin, 2001

1995
Constraint Categorial Grammars.
Proceedings of the Progress in Artificial Intelligence, 1995

1993
Resolution of Constraints in Algebras of Rational Trees.
Proceedings of the Progress in Artificial Intelligence, 1993

1991
An History Based Interface.
Proceedings of the ICLP 1991 Workshop on Logic Programming Environments, 1991

The Formal and Processing Models of CLG.
Proceedings of the EACL 1991, 1991

1990
Natural Language and Natural Menus Interfaces.
Proceedings of the Modelling the Innovation: Communications, 1990

General Introduction.
Proceedings of the Natural Language Processing, 1990

CLG(n): Constraint Logic Grammars.
Proceedings of the 13th International Conference on Computational Linguistics, 1990

1989
Semantic Analysis of Time and Tense in Natural Language: An Implementation.
Proceedings of the EPIA 89, 1989


  Loading...