BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × France
1 × Germany
1 × Japan
1 × Russia
1 × Taiwan
Collaborated with:
J.Karhumäki S.Puzynina R.Mercas L.Q.Zamboni
Talks about:
theorem (5) abelian (4) hmelevskii (2) period (2) wilf (2) fine (2) alphabet (1) unknown (1) satisfi (1) reproof (1)

Person: Aleksi Saarela

DBLP DBLP: Saarela:Aleksi

Contributed to:

DLT 20142014
DLT 20132013
DLT 20122012
DLT 20122013
DLT 20092009
DLT 20082008

Wrote 6 papers:

DLT-2014-KarhumakiSZ #equivalence #theorem
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence (JK, AS, LQZ), pp. 203–214.
3-Abelian Cubes Are Avoidable on Binary Alphabets (RM, AS), pp. 374–383.
DLT-2012-KarhumakiPS #theorem
Fine and Wilf’s Theorem for k-Abelian Periods (JK, SP, AS), pp. 296–307.
DLT-J-2012-KarhumakiPS13 #theorem
Fine and Wilf’s Theorem for k-Abelian Periods (JK, SP, AS), pp. 1135–1152.
DLT-2009-Saarela #complexity #equation #on the #satisfiability #theorem
On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations (AS), pp. 443–453.
DLT-2008-KarhumakiS #analysis #theorem
An Analysis and a Reproof of Hmelevskii’s Theorem (JK, AS), pp. 467–478.

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.