BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Finland
1 × France
1 × Germany
1 × Italy
1 × Taiwan
2 × USA
Collaborated with:
J.A.Brzozowski E.Ukkonen M.Nykänen R.Hakli
Talks about:
automata (6) languag (4) minim (4) bideterminist (3) regular (3) multitap (2) transit (2) complex (2) string (2) reduct (2)

Person: Hellis Tamm

DBLP DBLP: Tamm:Hellis

Contributed to:

DLT 20122012
DLT 20122013
DLT 20112011
LATA 20102010
DLT 20072007
DLT 20072008
CIAA 20052005
CIAA 20042004
CIAA 20032003
PADL 19991999

Wrote 10 papers:

DLT-2012-BrzozowskiT #regular expression
Quotient Complexities of Atoms of Regular Languages (JAB, HT), pp. 50–61.
DLT-J-2012-BrzozowskiT13 #complexity #regular expression
Complexity of atoms of Regular Languages (JAB, HT), pp. 1009–1028.
DLT-2011-BrzozowskiT
Theory of Átomata (JAB, HT), pp. 105–116.
LATA-2010-Tamm #automaton
Some Minimality Results on Biresidual and Biseparable Automata (HT), pp. 573–584.
DLT-2007-Tamm #automaton #on the
On Transition Minimality of Bideterministic Automata (HT), pp. 411–421.
DLT-J-2007-Tamm08 #automaton #on the
On Transition Minimality of Bideterministic Automata (HT), pp. 677–690.
CIAA-2005-TammNU #automaton #multi #reduction
Size Reduction of Multitape Automata (HT, MN, EU), pp. 307–318.
CIAA-2004-TammNU #automaton #multi #reduction
Size Reduction of Multitape Automata (HT, MN, EU), pp. 329–330.
CIAA-2003-TammU #automaton #regular expression
Bideterministic Automata and Minimal Representations of Regular Languages (HT, EU), pp. 61–71.
PADL-1999-HakliNTU #declarative #implementation #query #string
Implementing a Declarative String Query Language with String Restructuring (RH, MN, HT, EU), pp. 179–195.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.