Publications (12)

Sort by: Date |
10 | 25 | 50 | 100 
Previous page Previous page1/2 Next page Last page
3 A M O S T W All 
3-abelian cubes are avoidable on binary alphabets
(2013)
Lecture Notes in Computer Science
Robert Mercas, Aleksi Saarela
A note on square-free shuffles of words
(2013)
Lecture Notes in Computer Science
Tero Harju
Matematiikan kirjallinen kielentäminen yliopiston matematiikan opetuksessa
(2013)
Tutkimuksia / Jyväskylän yliopisto, opettajankoulutuslaitos
Jorma Joutsenlahti, Hanna Sarikka, Jussi Kangas, Petteri Harjulehto
Strongly k-abelian repetitions
(2013)
Lecture Notes in Computer Science
Mari Huova, Aleksi Saarela
Tiling Problems on Baumslag-Solitar groups
(2013)
Electronic Proceedings in Theoretical Computer Science
Nathalie Aubrun, Jarkko Kari
Weakly unambiguous morphisms with respect to sets of patterns with constants
(2013)
Lecture Notes in Computer Science
Aleksi Saarela
On the Periodicity of Morphic Words
(2010)
Lecture Notes in Computer Science
Harju, Tero; Halava, Vesa; Kärki, Tomi; Rigo, Michel
An undecidability result concerning periodic morphisms
(2002)
Lecture Notes in Computer Science
Halava V, Harju T
Multicovering bounds from relative covering radii
(2000)
IEEE International Symposium on Information Theory
Honkala I, Klapper A
On codes that call identify vertices in graphs
(2000)
IEEE International Symposium on Information Theory
Cohen G, Honkala I, Lobstein A, Zemor G
10 | 25 | 50 | 100 
Previous page Previous page1/2 Next page Last page
Share link