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