Hellis Tamm

29 papers A* 1B 2C 10Journal 11Unranked 5
YearRankTypeTitle / Venue / Authors
2024 J jnl
Yet another canonical nondeterministic automaton.
Theor. Comput. Sci.
Hendrik Maarand, Hellis Tamm
2023 — conf
Duality of lattices associated to left and right quotients.
AFL
Jason P. Bell, Daniel Smertnig, Hellis Tamm
2022 J jnl
Quotients and atoms of reversible languages.
Theor. Comput. Sci.
Hellis Tamm
2022 — conf
Yet Another Canonical Nondeterministic Automaton.
DCFS
Hendrik Maarand, Hellis Tamm
2021 B conf
Boolean Automata and Atoms of Regular Languages.
MFCS
Hellis Tamm
2019 — conf
Quotients and Atoms of Reversible Languages.
FM Workshops (2)
Hellis Tamm
2018 B conf
Theoretical Aspects of Symbolic Automata.
SOFSEM
Hellis Tamm, Margus Veanes
2017 C conf
Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited.
LATA
Hellis Tamm, Brink van der Merwe
2016 A* conf
New Interpretation and Generalization of the Kameda-Weiner Method.
ICALP
Hellis Tamm
2015 — conf
Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton.
DCFS
Hellis Tamm
2014 J jnl
Theory of átomata.
Theor. Comput. Sci.
Janusz A. Brzozowski, Hellis Tamm
2013 J jnl
Complexity of atoms of Regular Languages.
Int. J. Found. Comput. Sci.
Janusz A. Brzozowski, Hellis Tamm
2013 J jnl
Minimal Nondeterministic Finite Automata and Atoms of Regular Languages
CoRR
Janusz A. Brzozowski, Hellis Tamm
2012 — conf
Minimal DFA for Symmetric Difference NFA.
DCFS
Brink van der Merwe, Hellis Tamm, Lynette van Zijl
2012 J jnl
Quotient Complexities of Atoms of Regular Languages
CoRR
Janusz A. Brzozowski, Hellis Tamm
2012 C conf
Quotient Complexities of Atoms of Regular Languages.
Developments in Language Theory
Janusz A. Brzozowski, Hellis Tamm
2011 J jnl
Theory of Atomata
CoRR
Janusz A. Brzozowski, Hellis Tamm
2011 C conf
Theory of Átomata.
Developments in Language Theory
Janusz A. Brzozowski, Hellis Tamm
2010 C conf
Some Minimality Results on Biresidual and Biseparable Automata.
LATA
Hellis Tamm
2008 J jnl
On Transition Minimality of Bideterministic Automata.
Int. J. Found. Comput. Sci.
Hellis Tamm
2007 C conf
On Transition Minimality of Bideterministic Automata.
Developments in Language Theory
Hellis Tamm
2006 J jnl
On size reduction techniques for multitape automata.
Theor. Comput. Sci.
Hellis Tamm, Matti Nykänen, Esko Ukkonen
2005 C conf
Size Reduction of Multitape Automata.
CIAA
Hellis Tamm, Matti Nykänen, Esko Ukkonen
2004 J jnl
Bideterministic automata and minimal representations of regular languages.
Theor. Comput. Sci.
Hellis Tamm, Esko Ukkonen
2004 C conf
Size Reduction of Multitape Automata.
CIAA
Hellis Tamm, Matti Nykänen, Esko Ukkonen
2003 C conf
Bideterministic Automata and Minimal Representations of Regular Languages.
CIAA
Hellis Tamm, Esko Ukkonen
2003 J jnl
Design and implementation of a string database query language.
Inf. Syst.
Gösta Grahne, Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen
2000 C conf
Adding String Processing Capabilities to Data Management Systems.
SPIRE
Raul Hakli, Matti Nykänen, Hellis Tamm
1999 C conf
Implementing a Declarative String Query Language with String Restructuring.
PADL
Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen