Follow
Hellis Tamm
Hellis Tamm
Verified email at cs.ioc.ee
Title
Cited by
Cited by
Year
Theory of átomata
J Brzozowski, H Tamm
Theoretical Computer Science 539, 13-27, 2014
842014
Complexity of atoms of regular languages
J Brzozowski, H Tamm
International Journal of Foundations of Computer Science 24 (07), 1009-1027, 2013
222013
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
161998
Bideterministic automata and minimal representations of regular languages
H Tamm, E Ukkonen
Theoretical Computer Science 328 (1-2), 135-149, 2004
152004
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
132003
Quotient complexities of atoms of regular languages
J Brzozowski, H Tamm
International Conference on Developments in Language Theory, 50-61, 2012
122012
New interpretation and generalization of the Kameda-Weiner method
H Tamm
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
102016
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
92012
Bideterministic automata and minimal representations of regular languages
H Tamm, E Ukkonen
International Conference on Implementation and Application of Automata, 61-71, 2003
82003
Theoretical aspects of symbolic automata
H Tamm, M Veanes
International Conference on Current Trends in Theory and Practice of …, 2017
52017
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
52015
Adding string processing capabilities to data management systems
R Hakli, M Nykanen, H Tamm
Proceedings Seventh International Symposium on String Processing and …, 2000
52000
On transition minimality of bideterministic automata
H Tamm
International Journal of Foundations of Computer Science 19 (03), 677-690, 2008
42008
On transition minimality of bideterministic automata
H Tamm
International Conference on Developments in Language Theory, 411-421, 2007
42007
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
32017
On size reduction techniques for multitape automata
H Tamm, M Nykänen, E Ukkonen
Theoretical computer science 363 (2), 234-246, 2006
32006
Some minimality results on biresidual and biseparable automata
H Tamm
Language and Automata Theory and Applications: 4th International Conference …, 2010
22010
Size reduction of multitape automata
H Tamm, M Nykänen, E Ukkonen
International Conference on Implementation and Application of Automata, 307-318, 2005
22005
Boolean automata and atoms of regular languages
H Tamm
46th International Symposium on Mathematical Foundations of Computer Science …, 2021
12021
Minimal nondeterministic finite automata and atoms of regular languages
J Brzozowski, H Tamm
arXiv preprint arXiv:1301.5585, 2013
12013
The system can't perform the operation now. Try again later.
Articles 1–20