Height-deterministic pushdown automata D Nowotka, J Srba International Symposium on Mathematical Foundations of Computer Science, 125-134, 2007 | 49 | 2007 |

Testing generalised freeness of words P Gawrychowski, F Manea, D Nowotka 31st International Symposium on Theoretical Aspects of Computer Science …, 2014 | 26 | 2014 |

The Equation x^{i} = y^{j}z^{k} in a Free SemigroupT Harju, D Nowotka Semigroup Forum 68 (3), 488-490, 2004 | 26 | 2004 |

Finding pseudo-repetitions P Gawrychowski, F Manea, R Mercas, D Nowotka, C Tiseanu LIPIcs-Leibniz International Proceedings in Informatics 20, 257-268, 2013 | 25 | 2013 |

Binary words with few squares T Harju, D Nowotka Bulletin of the EATCS 89, 164-166, 2006 | 24 | 2006 |

Minimal duval extensions T Harju, D Nowotka International Journal of Foundations of Computer Science 15 (02), 349-354, 2004 | 23 | 2004 |

Fine and Wilf’s theorem and pseudo-repetitions F Manea, R Mercaş, D Nowotka International Symposium on Mathematical Foundations of Computer Science, 668-680, 2012 | 22 | 2012 |

On the equation xk= z1k1z2k2⋯ znkn in a free semigroup T Harju, D Nowotka Theoretical Computer Science 330 (1), 117-121, 2005 | 19 | 2005 |

On the equation xk= z1k1z2k2⋯ znkn in a free semigroup T Harju, D Nowotka Theoretical Computer Science 330 (1), 117-121, 2005 | 19 | 2005 |

Periodicity and unbordered words: A proof of the extended Duval conjecture T Harju, D Nowotka Journal of the ACM (JACM) 54 (4), 20-es, 2007 | 18 | 2007 |

Periodicity and unbordered words: A proof of the extended Duval conjecture T Harju, D Nowotka Journal of the ACM (JACM) 54 (4), 20-es, 2007 | 18 | 2007 |

Density of critical factorizations T Harju, D Nowotka RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2002 | 18 | 2002 |

On the independence of equations in three variables T Harju, D Nowotka Theoretical computer science 307 (1), 139-172, 2003 | 17 | 2003 |

Discovering hidden repetitions in words P Gawrychowski, F Manea, D Nowotka Conference on Computability in Europe, 210-219, 2013 | 16 | 2013 |

The hardness of solving simple word equations JD Day, F Manea, D Nowotka arXiv preprint arXiv:1702.07922, 2017 | 15 | 2017 |

The avoidability of cubes under permutations F Manea, M Müller, D Nowotka International Conference on Developments in Language Theory, 416-427, 2012 | 15 | 2012 |

Estimation of the click volume by large scale regression analysis Y Lifshits, D Nowotka International Computer Science Symposium in Russia, 216-226, 2007 | 15 | 2007 |

Periodicity and unbordered words T Harju, D Nowotka Annual Symposium on Theoretical Aspects of Computer Science, 294-304, 2004 | 15 | 2004 |

The satisfiability of word equations: Decidable and undecidable theories JD Day, V Ganesh, P He, F Manea, D Nowotka International Conference on Reachability Problems, 15-29, 2018 | 14 | 2018 |

Unary patterns with involution B Bischoff, J Currie, D Nowotka International Journal of Foundations of Computer Science 23 (08), 1641-1652, 2012 | 14 | 2012 |