| Combinatorics of words C Choffrut, J Karhumäki Handbook of formal languages, 329-438, 1997 | 433 | 1997 |
| The equivalence problem of multitape finite automata T Harju, J Karhumäki Theoretical Computer Science 78 (2), 347-355, 1991 | 172 | 1991 |
| Combinatorics on words-a tutorial J Berstel, J Karhumäki | 118 | 2003 |
| Morphisms T Harju, J Karhumäki Handbook of formal languages, 439-510, 1997 | 115 | 1997 |
| The (generalized) Post correspondence problem with lists consisting of two words is decidable A Ehrenfeucht, J Karhumäki, G Rozenberg Theoretical Computer Science 21 (2), 119-144, 1982 | 114 | 1982 |
| Finite automata computing real functions K Culik, II, J Karhumäki SIAM Journal on Computing 23 (4), 789-814, 1994 | 111 | 1994 |
| On cube-free ω-words generated by binary morphisms J Karhumäki Discrete Applied Mathematics 5 (3), 279-297, 1983 | 107* | 1983 |
| The equivalence of finite valued transducers (on HDT0L languages) is decidable K Culik II, J Karhumäki Theoretical Computer Science 47, 71-84, 1986 | 106 | 1986 |
| Skolem’s problem–on the border between decidability and undecidability V Halava, T Harju, M Hirvensalo, J Karhumäki Technical Report 683, Turku Centre for Computer Science, 2005 | 105 | 2005 |
| The expressibility of languages and relations by word equations J Karhumäki, F Mignosi, W Plandowski Journal of the ACM (JACM) 47 (3), 483-505, 2000 | 101 | 2000 |
| Communication complexity method for measuring nondeterminism in finite automata J Hromkovič, S Seibert, J Karhumäki, H Klauck, G Schnitger Information and Computation 172 (2), 202-217, 2002 | 90 | 2002 |
| Systems of equations over a free monoid and Ehrenfeucht's Conjecture K Culik II, J Karhumäki Discrete Mathematics 43 (2-3), 139-153, 1983 | 89 | 1983 |
| Polynomial versus exponential growth in repetition-free binary words J Karhumäki, J Shallit Journal of Combinatorial Theory, Series A 105 (2), 335-347, 2004 | 82 | 2004 |
| On the undecidability of freeness of matrix semigroups J Cassaigne, T Harju, J Karhumäki International Journal of Algebra and Computation 9 (03n04), 295-305, 1999 | 76 | 1999 |
| On a generalization of Abelian equivalence and complexity of infinite words J Karhumaki, A Saarela, LQ Zamboni Journal of Combinatorial Theory, Series A 120 (8), 2189-2206, 2013 | 68 | 2013 |
| Toeplitz words, generalized periodicity and periodically iterated morphisms J Cassaigne, J Karhumäki European Journal of Combinatorics 18 (5), 497-510, 1997 | 68 | 1997 |
| Some decision problems concerning semilinearity and commutation T Harju, O Ibarra, J Karhumäki, A Salomaa Journal of Computer and System Sciences 65 (2), 278-294, 2002 | 67 | 2002 |
| A note on synchronized automata and road coloring problem K Culik, J Karhumäki, J Kari International Journal of Foundations of Computer Science 13 (03), 459-471, 2002 | 57 | 2002 |
| The commutation of finite sets: a challenging problem C Choffrut, J Karhumäki, N Ollinger Theoretical computer science 273 (1-2), 69-79, 2002 | 50 | 2002 |
| On the power of synchronization in parallel computations J Hromkovič, J Karhumäki, B Rovan, A Slovodová Discrete applied mathematics 32 (2), 155-182, 1991 | 49 | 1991 |
