| Theory of átomata J Brzozowski, H Tamm Theoretical Computer Science 539, 13-27, 2014 | 88 | 2014 |
| Complexity of atoms of regular languages J Brzozowski, H Tamm International Journal of Foundations of Computer Science 24 (07), 1009-1027, 2013 | 23 | 2013 |
| Bideterministic automata and minimal representations of regular languages H Tamm, E Ukkonen Theoretical Computer Science 328 (1-2), 135-149, 2004 | 16 | 2004 |
| Implementing a declarative string query language with string restructuring R Hakli, M Nykänen, H Tamm, E Ukkonen Practical Aspects of Declarative Languages: First International Workshop …, 1998 | 16 | 1998 |
| Quotient complexities of atoms of regular languages J Brzozowski, H Tamm International Conference on Developments in Language Theory, 50-61, 2012 | 13 | 2012 |
| Design and implementation of a string database query language G Grahne, R Hakli, M Nykänen, H Tamm, E Ukkonen Information Systems 28 (4), 311-337, 2003 | 13 | 2003 |
| New interpretation and generalization of the Kameda-Weiner method H Tamm 43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016 | 10 | 2016 |
| Minimal DFA for symmetric difference NFA B Van der Merwe, H Tamm, L Van Zijl International Workshop on Descriptional Complexity of Formal Systems, 307-318, 2012 | 9 | 2012 |
| Theoretical aspects of symbolic automata H Tamm, M Veanes International Conference on Current Trends in Theory and Practice of …, 2017 | 8 | 2017 |
| Bideterministic automata and minimal representations of regular languages H Tamm, E Ukkonen International Conference on Implementation and Application of Automata, 61-71, 2003 | 8 | 2003 |
| Generalization of the double-reversal method of finding a canonical residual finite state automaton H Tamm International Workshop on Descriptional Complexity of Formal Systems, 268-279, 2015 | 5 | 2015 |
| Adding string processing capabilities to data management systems R Hakli, M Nykanen, H Tamm Proceedings Seventh International Symposium on String Processing and …, 2000 | 5 | 2000 |
| On transition minimality of bideterministic automata H Tamm International Journal of Foundations of Computer Science 19 (03), 677-690, 2008 | 4 | 2008 |
| On transition minimality of bideterministic automata H Tamm International Conference on Developments in Language Theory, 411-421, 2007 | 4 | 2007 |
| Lower bound methods for the size of nondeterministic finite automata revisited H Tamm, B van der Merwe International Conference on Language and Automata Theory and Applications …, 2017 | 3 | 2017 |
| Some minimality results on biresidual and biseparable automata H Tamm Language and Automata Theory and Applications: 4th International Conference …, 2010 | 3 | 2010 |
| On size reduction techniques for multitape automata H Tamm, M Nykänen, E Ukkonen Theoretical computer science 363 (2), 234-246, 2006 | 3 | 2006 |
| Minimal nondeterministic finite automata and atoms of regular languages J Brzozowski, H Tamm arXiv preprint arXiv:1301.5585, 2013 | 2 | 2013 |
| Size reduction of multitape automata H Tamm, M Nykänen, E Ukkonen International Conference on Implementation and Application of Automata, 307-318, 2005 | 2 | 2005 |
| Yet another canonical nondeterministic automaton H Maarand, H Tamm Theoretical Computer Science 1001, 114581, 2024 | 1 | 2024 |
Raul HakliUniversity of HelsinkiDirección de correo verificada de helsinki.fi
