| 2018 | DLT | On Abelian Subshifts. | Juhani Karhumki, Svetlana Puzynina, Markus A. Whiteland |
| 2016 | DLT | k-Abelian Equivalence and Rationality. | Julien Cassaigne, Juhani Karhumki, Svetlana Puzynina, Markus A. Whiteland |
| 2016 | DLT | Degrees of Infinite Words, Polynomials and Atoms. | Jrg Endrullis, Juhani Karhumki, Jan Willem Klop, Aleksi Saarela |
| 2015 | CSR | On Growth and Fluctuation of k-Abelian Complexity. | Julien Cassaigne, Juhani Karhumki, Aleksi Saarela |
| 2014 | DLT | On k-Abelian Palindromic Rich and Poor Words. | Juhani Karhumki, Svetlana Puzynina |
| 2014 | DLT | Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence. | Juhani Karhumki, Aleksi Saarela, Luca Q. Zamboni |
| 2012 | DLT | Fine and Wilf's Theorem for k-Abelian Periods. | Juhani Karhumki, Svetlana Puzynina, Aleksi Saarela |
| 2011 | UC | Weighted Finite Automata: Computing with Different Topologies. | Juhani Karhumki, Turo Sallinen |
| 2009 | CSR | Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. | Christian Choffrut, Juhani Karhumki |
| 2008 | DLT | An Analysis and a Reproof of Hmelevskii's Theorem. | Juhani Karhumki, Aleksi Saarela |
| 2008 | LATIN | On Stateless Multihead Automata: Hierarchies and the Emptiness Problem. | Oscar H. Ibarra, Juhani Karhumki, Alexander Okhotin |
| 2007 | CPM | Tiling Periodicity. | Juhani Karhumki, Yury Lifshits, Wojciech Rytter |
| 2006 | ICALP | Communication of Two Stacks and Rewriting. | Juhani Karhumki, Michal Kunc, Alexander Okhotin |
| 2004 | MCU | Finite Sets of Words and Computing. | Juhani Karhumki |
| 2003 | STACS | The Commutation with Codes and Ternary Sets of Words. | Juhani Karhumki, Michel Latteux, Ion Petre |
| 2002 | ICALP | The Equivalence Problem of Finite Substitutions on ab | Juhani Karhumki, Leonid P. Lisovik |
| 2002 | MFCS | Computing Partial Information out of Intractable One - The First Digit of 2 | Mika Hirvensalo, Juhani Karhumki |
| 2002 | MFCS | Applications of Finite Automata. | Juhani Karhumki |
| 2001 | DLT | A Note on Synchronized Automata and Road Coloring Problem. | Karel Culk II, Juhani Karhumki, Jarkko Kari |
| 2001 | FCT | Challenges of Commutation. | Juhani Karhumki |
| 2001 | FCT | On the Complexity of Decidable Cases of Commutation Problem for Languages. | Juhani Karhumki, Wojciech Plandowski, Wojciech Rytter |
| 2001 | ICALP | Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages. | Tero Harju, Oscar H. Ibarra, Juhani Karhumki, Arto Salomaa |
| 2001 | MCU | Combinatorial and Computational Problems on Finite Sets of Words. | Juhani Karhumki |
| 2001 | STACS | A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab | Juhani Karhumki, Leonid P. Lisovik |
| 2000 | ICALP | Measures of Nondeterminism in Finite Automata. | Juraj Hromkovic, Juhani Karhumki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert |
| 2000 | ICALP | On the Centralizer of a Finite Set. | Juhani Karhumki, Ion Petre |
| 1999 | CPM | The Compression of Subsegments of Images Described by Finite Automata. | Juhani Karhumki, Wojciech Plandowski, Wojciech Rytter |
| 1999 | DLT | Defect theorems for trees. | Juhani Karhumki, Sabrina Mantaci |
| 1999 | DLT | On the complexity of computing the order of repetition of a string. | Juhani Karhumki, Wojciech Plandowski |
| 1998 | ICALP | Locally Periodic Infinite Words and a Chaotic Behaviour. | Juhani Karhumki, Arto Lepist, Wojciech Plandowski |
| 1998 | MFCS | On Defect Effect of Bi-Infinite Words. | Juhani Karhumki, Jn Manuch, Wojciech Plandowski |
| 1997 | DLT | A lower bound for a constant in Shallit's conjecture. | Juhani Karhumki, Wojciech Plandowski, Filippo Mignosi |
| 1997 | FCT | Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata. | Juhani Karhumki, Wojciech Plandowski, Wojciech Rytter |
| 1997 | ICALP | The Expressibility of Languages and Relations by Word Equations. | Juhani Karhumki, Wojciech Plandowski, Filippo Mignosi |
| 1996 | STACS | Remarks on Generalized Post Correspondence Problem. | Tero Harju, Juhani Karhumki, Daniel Krob |
| 1995 | COCOON | Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract). | Julien Cassaigne, Juhani Karhumki |
| 1995 | ICALP | Compactness of Systems of Equations in Semigroups. | Tero Harju, Juhani Karhumki, Wojciech Plandowski |
| 1994 | MFCS | On the Size of Independent Systems of Equations in Semigroups. | Juhani Karhumki, Wojciech Plandowski |
| 1992 | ICALP | Polynomial Size Test Sets for Context-Free Languages. | Juhani Karhumki, Wojciech Plandowski, Wojciech Rytter |
| 1992 | MFCS | On Computational Power of Weighted Finite Automata. | Denis Derencourt, Juhani Karhumki, Michel Latteux, Alain Terlutte |
| 1992 | STACS | Iterative Devices Generating Infinite Words. | Karel Culk II, Juhani Karhumki |
| 1991 | MFCS | Efficient Constructions of Test Sets for Regular and Context-Free Languages. | Juhani Karhumki, Wojciech Rytter, Stefan Jarominek |
| 1990 | STOC | Decidability of the Multiplicity Equivalence of Multitape Finite Automata | Tero Harju, Juhani Karhumki |
| 1989 | MFCS | On the Power of Synchronization in Parallel Computations. | Jrgen Dassow, Juraj Hromkovic, Juhani Karhumki, Branislav Rovan, Anna Slobodov |
| 1989 | STACS | On the Equivalence Problem for Deterministic Multitape Automata and Transducers. | Karel Culk II, Juhani Karhumki |
| 1987 | ICALP | On Recent Trends in Formal Language Theory. | Juhani Karhumki |
| 1986 | MFCS | The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable. | Karel Culk II, Juhani Karhumki |
| 1984 | ICALP | On Three-Element Codes. | Juhani Karhumki |
| 1984 | MFCS | On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages. | Juhani Karhumki, H. C. M. Kleijn |
| 1984 | STACS | A Property of Three-Element Codes. | Juhani Karhumki |
| 1983 | ICALP | Test Sets for Morphisms with Bounded Delay. | Christian Choffrut, Juhani Karhumki |
| 1983 | ICALP | A Note on Intersections of Free Submonoids of a Free Monoid. | Juhani Karhumki |
| 1982 | ICALP | On the Equivalence Problem for Binary DOL Systems. | Juhani Karhumki |
| 1981 | FCT | On Strongly Cube-Free Omega-Words Generated by Binary Morphisms. | Juhani Karhumki |
| 1981 | ICALP | Generalized Parikh Mappings and Homomorphisms. | Juhani Karhumki |
| 1979 | MFCS | Interactive L Systems with Almost Interactionless Behaviour. | Karel Culk II, Juhani Karhumki |