default search action
Hellis Tamm
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Hendrik Maarand, Hellis Tamm:
Yet another canonical nondeterministic automaton. Theor. Comput. Sci. 1001: 114581 (2024) - 2023
- [c18]Jason P. Bell, Daniel Smertnig, Hellis Tamm:
Duality of lattices associated to left and right quotients. AFL 2023: 35-50 - 2022
- [j7]Hellis Tamm
:
Quotients and atoms of reversible languages. Theor. Comput. Sci. 920: 33-45 (2022) - [c17]Hendrik Maarand
Yet Another Canonical Nondeterministic Automaton. DCFS 2022: 184-196 - 2021
- [c16]Hellis Tamm
Boolean Automata and Atoms of Regular Languages. MFCS 2021: 86:1-86:13
2010 – 2019
- 2019
- [c15]Hellis Tamm
Quotients and Atoms of Reversible Languages. FM Workshops (2) 2019: 443-455 - 2018
- [c14]Hellis Tamm
Theoretical Aspects of Symbolic Automata. SOFSEM 2018: 428-441 - 2017
- [c13]Hellis Tamm
Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited. LATA 2017: 261-272 - 2016
- [c12]Hellis Tamm
New Interpretation and Generalization of the Kameda-Weiner Method. ICALP 2016: 116:1-116:12 - 2015
- [c11]Hellis Tamm
Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton. DCFS 2015: 268-279 - 2014
- [j6]Janusz A. Brzozowski, Hellis Tamm
Theory of átomata. Theor. Comput. Sci. 539: 13-27 (2014) - 2013
- [j5]Janusz A. Brzozowski, Hellis Tamm
Complexity of atoms of Regular Languages. Int. J. Found. Comput. Sci. 24(7): 1009-1028 (2013) - [i3]Janusz A. Brzozowski, Hellis Tamm:
Minimal Nondeterministic Finite Automata and Atoms of Regular Languages. CoRR abs/1301.5585 (2013) - 2012
- [c10]Brink van der Merwe, Hellis Tamm
Minimal DFA for Symmetric Difference NFA. DCFS 2012: 307-318 - [c9]Janusz A. Brzozowski, Hellis Tamm
Quotient Complexities of Atoms of Regular Languages. Developments in Language Theory 2012: 50-61 - [i2]Janusz A. Brzozowski, Hellis Tamm:
Quotient Complexities of Atoms of Regular Languages. CoRR abs/1201.0295 (2012) - 2011
- [c8]Janusz A. Brzozowski, Hellis Tamm
Theory of Átomata. Developments in Language Theory 2011: 105-116 - [i1]Janusz A. Brzozowski, Hellis Tamm:
Theory of Atomata. CoRR abs/1102.3901 (2011) - 2010
- [c7]Hellis Tamm
Some Minimality Results on Biresidual and Biseparable Automata. LATA 2010: 573-584
2000 – 2009
- 2008
- [j4]Hellis Tamm
On Transition Minimality of Bideterministic Automata. Int. J. Found. Comput. Sci. 19(3): 677-690 (2008) - 2007
- [c6]Hellis Tamm:
On Transition Minimality of Bideterministic Automata. Developments in Language Theory 2007: 411-421 - 2006
- [j3]Hellis Tamm
On size reduction techniques for multitape automata. Theor. Comput. Sci. 363(2): 234-246 (2006) - 2005
- [c5]Hellis Tamm
Size Reduction of Multitape Automata. CIAA 2005: 307-318 - 2004
- [j2]Hellis Tamm
Bideterministic automata and minimal representations of regular languages. Theor. Comput. Sci. 328(1-2): 135-149 (2004) - [c4]Hellis Tamm, Matti Nykänen, Esko Ukkonen:
Size Reduction of Multitape Automata. CIAA 2004: 329-330 - 2003
- [j1]Gösta Grahne, Raul Hakli
Design and implementation of a string database query language. Inf. Syst. 28(4): 311-337 (2003) - [c3]Hellis Tamm, Esko Ukkonen:
Bideterministic Automata and Minimal Representations of Regular Languages. CIAA 2003: 61-71 - 2000
- [c2]Raul Hakli
Adding String Processing Capabilities to Data Management Systems. SPIRE 2000: 122-131
1990 – 1999
- 1999
- [c1]Raul Hakli, Matti Nykänen, Hellis Tamm, Esko Ukkonen:
Implementing a Declarative String Query Language with String Restructuring. PADL 1999: 179-195
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-20 00:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: