Hellis Tamm

Publications Tamm, H. Some minimality results on biresidual and biseparable automata. In: 4th International Conference on Language and Automata Theory and Applications (LATA 2010), Trier, Germany, May 24-28, 2010, Springer, LNCS, to appear.

  • Tamm, H. On transition minimality of bideterministic automata. International Journal of Foundations of Computer Science, 19(3), 2008, 677 - 690.

  • Tamm, H. On transition minimality of bideterministic automata. In: Developments in Language Theory : 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings, Springer, 2007, Lecture Notes in Computer Science 4588, 411 - 421.

  • Tamm, H., Nykänen, M., and Ukkonen, E. On size reduction techniques for multitape automata. Theoretical Computer Science, 363(2), 2006, 234 - 246.

  • Tamm, H., Nykänen, M., and Ukkonen, E. Size reduction of multitape automata. Proc. 10th Int. Conf. on Implementation and Application of Automata (CIAA 2005), Lecture Notes in Computer Science 3845, Springer, 2006, 307-318.

  • Tamm, H., and Ukkonen, E. Bideterministic automata and minimal representations of regular languages. Theoretical Computer Science, 328, 1-2 (2004), 135-149.

  • Tamm, H., and Ukkonen, E. Bideterministic automata and minimal representations of regular languages. Proc. Eighth Int. Conf. on Implementation and Application of Automata (CIAA 2003), Lecture Notes in Computer Science 2759, Springer, 2003, 61-71.

  • Grahne, G., Hakli, R., Nykänen, M., Tamm, H., and Ukkonen, E. Design and implementation of a string database query language. Information Systems, 28, (2003), 311-337.

  • Hakli, R., Nykänen, M., and Tamm, H. Adding string processing capabilities to data management systems. Proc. Seventh Int. Symp. on String Processing and Information Retrieval (SPIRE 2000), IEEE Computer Society Press, Silver Spring, MD, 2000, 122-131.

  • Hakli, R., Nykänen, M., Tamm, H., and Ukkonen, E. Implementing a declarative string query language with string restructuring. Proc. First Int. Workshop on Practical Aspects of Declarative Languages (PADL'99), Lecture Notes in Computer Science 1551, Springer, 1999, 179-195.

    My PhD thesis: "On minimality and size reduction of one-tape and multitape finite automata", University of Helsinki, 2004.