Nelma Moreira
Faculdade de Ciências da Universidade do Porto
.
| 2016 | Channels with Synchronization/Substitution Errors and Computation of Error Control Codes |
CoRR | 2016 | misc | ||
| 2016 | Distinguishability Operations and Closures |
Fundamenta Informaticae | 2016 | article | ||
| 2016 | Formalization of the Pumping Lemma for Context-Free Languages |
Journal of Formalized Reasoning | 2016 | article | ||
| 2016 | Generating error control codes with automata and transducers |
Eighth Workshop on Non-Classical Models of Automata and Applications, NCMA 2016, Debrecen, Hungary, August 29-30, 2016. Proceedings | 2016 | inproceedings | ||
| 2016 | Implementation of Code Properties via Transducers |
Implementation and Application of Automata | 2016 | inproceedings | ||
| 2016 | On the dissimilarity operation on finite languages |
Eighth Workshop on Non-Classical Models of Automata and Applications, NCMA 2016, Debrecen, Hungary, August 29-30, 2016. Proceedings | 2016 | inproceedings | ||
| 2016 | On the Formalization of Some Results of Context-Free Language Theory |
Logic, Language, Information, and Computation | 2016 | inproceedings | ||
| 2016 | On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection |
Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings | 2016 | inproceedings | ||
| 2016 | Position Automaton Construction for Regular Expressions with Intersection |
Developments in Language Theory, Dlt 2016 | 2016 | inproceedings | ||
| 2016 | Preface: Non-classical models of automata and applications VII |
RAIRO - Theoretical Informatics and Applications | 2016 | misc | ||
| 2015 | Average Size of Automata Constructions from Regular Expressions |
Bulletin of the EATCS | 2015 | article | ||
| 2015 | Deciding Kleene algebra terms equivalence in Coq |
Journal of Logical and Algebraic Methods in Programming | 2015 | article | ||
| 2015 | Deciding synchronous Kleene algebra with derivatives |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2015 | inproceedings | ||
| 2015 | Formalization of context-free language theory |
CoRR | 2015 | misc | ||
| 2015 | Incomplete operational transition complexity of regular languages |
Information and Computation | 2015 | article | ||
| 2015 | Optimal State Reductions of Automata with Partially Specified Behaviors |
Sofsem 2015: Theory and Practice of Computer Science | 2015 | inproceedings | ||
| 2015 | Partial Derivative Automaton for Regular Expressions with Shuffle |
Descriptional Complexity of Formal Systems - 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings | 2015 | inproceedings | ||
| 2015 | Partial Derivative Automaton for Regular Expressions with Shuffle |
CoRR | 2015 | misc | ||
| 2015 | Prefix and Right-Partial Derivative Automata |
Evolving Computability | 2015 | inproceedings | ||
| 2015 | Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31 - September 1, 2015. Proceedings |
Ncma | 2015 | proceedings | ||
| 2015 | Symbolic Manipulation of Code Properties |
CoRR | 2015 | misc | ||
| 2015 | Universal Disjunctive Concatenation and Star |
Descriptional Complexity of Formal Systems - 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings | 2015 | inproceedings | ||
| 2014 | A Hitchhiker's Guide to descriptional complexity through analytic combinatorics |
Theoretical Computer Science | 2014 | article | ||
| 2014 | Incremental Dfa Minimisation |
Rairo-theoretical Informatics and Applications | 2014 | article | ||
| 2014 | On the Equivalence of Automata for KAT-expressions |
Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings | 2014 | inproceedings |