Rogério Reis
Faculdade de Ciências da Universidade do Porto
.
| 2012 | On the Average Size of Glushkov and Partial Derivative Automata |
International Journal of Foundations of Computer Science | 2012 | article | ||
| 2012 | Preface |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2012 | misc | ||
| 2011 | Incremental DFA Minimisation |
Implementation and Application of Automata | 2011 | inproceedings | ||
| 2011 | On the Average State Complexity of Partial Derivative Automata: An Analytic Combinatorics Approach |
International Journal of Foundations of Computer Science | 2011 | article | ||
| 2011 | The Average Transition Complexity of Glushkov and Partial Derivative Automata |
Developments in Language Theory - 15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings | 2011 | inproceedings | ||
| 2010 | Ainda o totobola: o singular caso dos 5 |
2010 | article | ||
| 2010 | On the Average Number of States of Partial Derivative Automata |
Developments in Language Theory | 2010 | inproceedings | ||
| 2010 | Small NFAs from Regular Expressions: Some Experimental Results |
CoRR | 2010 | misc | ||
| 2010 | State Elimination Ordering Strategies: Some Experimental Results |
Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS 2010, Saskatoon, Canada, 8-10th August 2010. | 2010 | inproceedings | ||
| 2010 | Testing the Equivalence of Regular Languages |
Journal of Automata, Languages and Combinatorics | 2010 | article | ||
| 2009 | Antimirov and Mosses's Rewrite System Revisited |
International Journal of Foundations of Computer Science | 2009 | article | ||
| 2009 | Antimirov and Mosses's Rewrite System Revisited |
Int. J. Found. Comput. Sci. | 2009 | article | ||
| 2009 | FAdo and GUItar: Tools for Automata Manipulation and Visualization |
Implementation and Application of Automata, Proceedings | 2009 | inproceedings | ||
| 2009 | Locating Cars through a Vision Enabled VANET |
2009 Ieee Intelligent Vehicles Symposium, Vols 1 and 2 | 2009 | inproceedings | ||
| 2009 | Series-Parallel Automata and Short Regular Expressions |
Fundamenta Informaticae | 2009 | article | ||
| 2009 | Testing the Equivalence of Regular Languages |
Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009, Magdeburg, Germany, July 6-9, 2009. | 2009 | inproceedings | ||
| 2008 | Exact generation of acyclic deterministic finite automata |
Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008 | 2008 | inproceedings | ||
| 2008 | Exact generation of minimal acyclic deterministic finite automata |
International Journal of Foundations of Computer Science | 2008 | article | ||
| 2007 | Automated ciphertext-only cryptanalysis of the Bifid cipher |
Cryptologia | 2007 | article | ||
| 2007 | Enumeration and generation with a string automata representation |
Theoretical Computer Science | 2007 | article | ||
| 2006 | Acyclic automata with easy-to-find short regular expressions |
Implementation and Application of Automata | 2006 | article | ||
| 2006 | Aspects of enumeration and generation with a string automata representation |
8th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2006 - Proceedings | 2006 | inproceedings | ||
| 2005 | Interactive manipulation of regular objects with FAdo |
Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2005, Caparica, Portugal, June 27-29, 2005 | 2005 | inproceedings | ||
| 2005 | On the density of languages representing finite set partitions |
Journal of Integer Sequences | 2005 | article | ||
| 2005 | On the representation of finite automata |
7th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2005 - Proceedings | 2005 | inproceedings |