Search the dblp DataBase

Publications of Author

1. Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen
   Implementing a Declarative String Query Language with String Restructuring. [Citation Graph (0, 0)][DBLP]
   PADL, 1999, pp:179-195 [Conf]
   
2. Raul Hakli, Matti Nykänen, Hellis Tamm
   Adding String Processing Capabilities to Data Management Systems. [Citation Graph (0, 0)][DBLP]
   SPIRE, 2000, pp:122-131 [Conf]
   
3. Hellis Tamm, Matti Nykänen, Esko Ukkonen
   Size Reduction of Multitape Automata. [Citation Graph (0, 0)][DBLP]
   CIAA, 2004, pp:329-330 [Conf]
   
4. Hellis Tamm, Matti Nykänen, Esko Ukkonen
   Size Reduction of Multitape Automata. [Citation Graph (0, 0)][DBLP]
   CIAA, 2005, pp:307-318 [Conf]
   
5. Hellis Tamm, Esko Ukkonen
   Bideterministic Automata and Minimal Representations of Regular Languages. [Citation Graph (0, 0)][DBLP]
   CIAA, 2003, pp:61-71 [Conf]
   
6. Gösta Grahne, Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen
   Design and implementation of a string database query language. [Citation Graph (0, 0)][DBLP]
   Inf. Syst., 2003, v:28, n:4, pp:311-337 [Journal]
   
7. Hellis Tamm, Matti Nykänen, Esko Ukkonen
   On size reduction techniques for multitape automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2006, v:363, n:2, pp:234-246 [Journal]
   
8. Hellis Tamm, Esko Ukkonen
   Bideterministic automata and minimal representations of regular languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:328, n:1-2, pp:135-149 [Journal]
   
9. Hellis Tamm
   On Transition Minimality of Bideterministic Automata. [Citation Graph (0, 0)][DBLP]
   Developments in Language Theory, 2007, pp:411-421 [Conf]
   
10. 
    Some Minimality Results on Biresidual and Biseparable Automata. [Citation Graph (, )][DBLP]