Nelma Moreira
Faculdade de Ciências da Universidade do Porto
.
| 2024 | Block Languages and their Bitmap Representations |
Implementation and Application of Automata - 28th International Conference, CIAA 2024, Akita, Japan, September 3-6, 2024, Proceedings | 2024 | inproceedings | ||
| 2024 | Compressed Structures for Partial Derivative Automata Constructions |
International Journal of Foundations of Computer Science | 2024 | article | ||
| 2024 | On the difference set of two transductions |
Theor. Comput. Sci. | 2024 | article | ||
| 2024 | On the Representation of Block Languages |
CoRR | 2024 | article | ||
| 2024 | Operational State Complexity of Block Languages |
Electronic Proceedings in Theoretical Computer Science | 2024 | inproceedings | ||
| 2024 | Regular Expressions Avoiding Absorbing Patterns and the Significance of Uniform Distribution |
International Journal of Foundations of Computer Science | 2024 | article | ||
| 2023 | 25th International Conference on Developments in Language Theory (DLT 2021): Preface |
International Journal of Foundations of Computer Science | 2023 | misc | ||
| 2023 | Approximate NFA universality and related problems motivated by information theory & nbsp; |
Theoretical Computer Science | 2023 | article | ||
| 2023 | Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions |
Implementation and Application of Automata - 27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19-22, 2023, Proceedings | 2023 | inproceedings | ||
| 2023 | Location automata for synchronised shuffle expressions |
Journal of Logical and Algebraic Methods in Programming | 2023 | article | ||
| 2023 | On the average complexity of partial derivative transducers *,**,*** |
THEORETICAL COMPUTER SCIENCE | 2023 | article | ||
| 2022 | Approximate NFA Universality and Related Problems Motivated by Information Theory |
CoRR | 2022 | misc | ||
| 2022 | Approximate NFA Universality Motivated by Information Theory |
Descriptional Complexity of Formal Systems, Dcfs 2022 | 2022 | inproceedings | ||
| 2022 | Location automata for regular expressions with shuffle and intersection |
Information and Computation | 2022 | article | ||
| 2022 | Manipulation of Regular Expressions Using Derivatives: An Overview |
Implementation and Application of Automata (ciaa 2022) | 2022 | inproceedings | ||
| 2021 | Developments in Language Theory - 25th International Conference, DLT 2021, Porto, Portugal, August 16-20, 2021, Proceedings |
Dlt | 2021 | proceedings | ||
| 2021 | Hot Current Topics of Descriptional Complexity |
Advancing Research in Information and Communication Technology - IFIP's Exciting First 60+ Years, Views from the Technical Committees and Working Groups | 2021 | incollection | ||
| 2021 | Location Based Automata for Expressions with Shuffle |
Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Milan, Italy, March 1-5, 2021, Proceedings | 2021 | inproceedings | ||
| 2021 | On the size of partial derivatives and the word membership problem |
Acta Informatica | 2021 | article | ||
| 2021 | On the Uniform Distribution of Regular Expressions |
CoRR | 2021 | misc | ||
| 2021 | On the Uniform Distribution of Regular Expressions |
Descriptional Complexity of Formal Systems, Dcfs 2021 | 2021 | inproceedings | ||
| 2021 | Partial Derivative Automaton by Compressing Regular Expressions |
Descriptional Complexity of Formal Systems, Dcfs 2021 | 2021 | inproceedings | ||
| 2021 | Partial derivatives of regular expressions over alphabet-invariant and user-defined labels |
Theor. Comput. Sci. | 2021 | article | ||
| 2021 | Preface |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2021 | misc | ||
| 2021 | The Prefix Automaton |
J. Autom. Lang. Comb. | 2021 | article |