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 | 60 | 2013 |

Problems in between words and abelian words: k-abelian avoidability M Huova, J Karhumäki, A Saarela Theoretical Computer Science 454, 172-177, 2012 | 25 | 2012 |

Variations of the Morse-Hedlund theorem for k-abelian equivalence J Karhumäki, A Saarela, LQ Zamboni International Conference on Developments in Language Theory, 203-214, 2014 | 24 | 2014 |

Fine and Wilf's theorem for k-Abelian periods J Karhumäki, S Puzynina, A Saarela International Journal of Foundations of Computer Science 24 (07), 1135-1152, 2013 | 20 | 2013 |

Local squares, periodicity and finite automata M Huova, J Karhumäki, A Saarela, K Saari Rainbow of computer science, 90-101, 2011 | 18* | 2011 |

Systems of word equations, polynomials and linear algebra: a new approach A Saarela European Journal of Combinatorics 47, 1-14, 2015 | 17 | 2015 |

Degrees of transducibility J Endrullis, JW Klop, A Saarela, M Whiteland International Conference on Combinatorics on Words, 1-13, 2015 | 15 | 2015 |

On growth and fluctuation of k-abelian complexity J Cassaigne, J Karhumäki, A Saarela European Journal of Combinatorics 65, 92-105, 2017 | 14 | 2017 |

5-abelian cubes are avoidable on binary alphabets R Mercaş, A Saarela RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2014 | 14 | 2014 |

Palindromic length in free monoids and free groups A Saarela International Conference on Combinatorics on Words, 203-213, 2017 | 13 | 2017 |

Ultimately Constant Abelian Complexity of Infinite Words. A Saarela J. Autom. Lang. Comb. 14 (3/4), 255-258, 2009 | 13 | 2009 |

Degrees of infinite words, polynomials and atoms J Endrullis, J Karhumäki, JW Klop, A Saarela International Journal of Foundations of Computer Science 29 (05), 825-843, 2018 | 10 | 2018 |

Word equations where a power equals a product of powers A Saarela 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), 2017 | 8 | 2017 |

Noneffective regularity of equality languages and bounded delay morphisms A Saarela, J Karhumaki Discrete Mathematics & Theoretical Computer Science 12, 2010 | 8 | 2010 |

Strongly *k*-Abelian RepetitionsM Huova, A Saarela Combinatorics on Words, 161-168, 2013 | 7 | 2013 |

On maximal chains of systems of word equations J Karhumäki, A Saarela Proceedings of the Steklov Institute of Mathematics 274 (1), 116, 2011 | 7 | 2011 |

On the complexity of Hmelevskii’s theorem and satisfiability of three unknown equations A Saarela International Conference on Developments in Language Theory, 443-453, 2009 | 7 | 2009 |

An optimal bound on the solution sets of one-variable word equations and its consequences D Nowotka, A Saarela arXiv preprint arXiv:1805.09535, 2018 | 6 | 2018 |

One-variable word equations and three-variable constant-free word equations D Nowotka, A Saarela International Journal of Foundations of Computer Science 29 (05), 935-950, 2018 | 5 | 2018 |

An analysis and a reproof of Hmelevskii’s theorem J Karhumäki, A Saarela International Conference on Developments in Language Theory, 467-478, 2008 | 5 | 2008 |