Hellis Tamm

According to our database, Hellis Tamm authored at least 21 papers between 1999 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Yet another canonical nondeterministic automaton.

Hendrik Maarand, Hellis Tamm

Theor. Comput. Sci., 2024

2023

Duality of lattices associated to left and right quotients.

Jason P. Bell, Daniel Smertnig, Hellis Tamm

Proceedings of the 16th International Conference on Automata and Formal Languages, 2023

2022

Quotients and atoms of reversible languages.

Hellis Tamm

Theor. Comput. Sci., 2022

2021

Boolean Automata and Atoms of Regular Languages.

Hellis Tamm

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2018

Theoretical Aspects of Symbolic Automata.

Hellis Tamm, Margus Veanes

Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

2017

Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited.

Hellis Tamm, Brink van der Merwe

Proceedings of the Language and Automata Theory and Applications, 2017

2016

New Interpretation and Generalization of the Kameda-Weiner Method.

Hellis Tamm

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton.

Hellis Tamm

Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014

Theory of átomata.

Janusz A. Brzozowski, Hellis Tamm

Theor. Comput. Sci., 2014

2013

Complexity of atoms of Regular Languages.

Janusz A. Brzozowski, Hellis Tamm

Int. J. Found. Comput. Sci., 2013

Minimal Nondeterministic Finite Automata and Atoms of Regular Languages

Janusz A. Brzozowski, Hellis Tamm

CoRR, 2013

2012

Quotient Complexities of Atoms of Regular Languages.

Janusz A. Brzozowski, Hellis Tamm

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

Minimal DFA for Symmetric Difference NFA.

Brink van der Merwe, Hellis Tamm, Lynette van Zijl

Proceedings of the Descriptional Complexity of Formal Systems, 2012

2010

Some Minimality Results on Biresidual and Biseparable Automata.

Hellis Tamm

Proceedings of the Language and Automata Theory and Applications, 2010

2008

On Transition Minimality of Bideterministic Automata.

Hellis Tamm

Int. J. Found. Comput. Sci., 2008

2006

On size reduction techniques for multitape automata.

Hellis Tamm, Matti Nykänen, Esko Ukkonen

Theor. Comput. Sci., 2006

2005

Size Reduction of Multitape Automata.

Hellis Tamm, Matti Nykänen, Esko Ukkonen

Proceedings of the Implementation and Application of Automata, 2005

2004

Bideterministic automata and minimal representations of regular languages.

Hellis Tamm, Esko Ukkonen

Theor. Comput. Sci., 2004

2003

Design and implementation of a string database query language.

Gösta Grahne, Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen

Inf. Syst., 2003

2000

Adding String Processing Capabilities to Data Management Systems.

Raul Hakli, Matti Nykänen, Hellis Tamm

Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

1999

Implementing a Declarative String Query Language with String Restructuring.

Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen

Proceedings of the Practical Aspects of Declarative Languages, 1999