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

An SMT solver for regular expressions and linear arithmetic over string length M Berzish, M Kulczynski, F Mora, F Manea, JD Day, D Nowotka, ... International Conference on Computer Aided Verification, 289-312, 2021 | 38 | 2021 |

The satisfiability of word equations: Decidable and undecidable theories JD Day, V Ganesh, P He, F Manea, D Nowotka Reachability Problems: 12th International Conference, RP 2018, Marseille …, 2018 | 36 | 2018 |

Scattered factor-universality of words L Barker, P Fleischmann, K Harwardt, F Manea, D Nowotka International Conference on Developments in Language Theory, 14-28, 2020 | 35 | 2020 |

On solving word equations using SAT JD Day, T Ehlers, M Kulczynski, F Manea, D Nowotka, DB Poulsen Reachability Problems: 13th International Conference, RP 2019, Brussels …, 2019 | 32 | 2019 |

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

Responsible and regulatory conform machine learning for medicine: a survey of challenges and solutions E Petersen, Y Potdevin, E Mohammadi, S Zidowitz, S Breyer, D Nowotka, ... IEEE Access 10, 58375-58418, 2022 | 26 | 2022 |

Z3str4: A multi-armed string solver F Mora, M Berzish, M Kulczynski, D Nowotka, V Ganesh Formal Methods: 24th International Symposium, FM 2021, Virtual Event …, 2021 | 26 | 2021 |

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

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

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

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

Finding pseudo-repetitions P Gawrychowski, F Manea, R Mercaş, D Nowotka, C Tiseanu | 23 | 2012 |

Density of critical factorizations T Harju, D Nowotka RAIRO-Theoretical Informatics and Applications 36 (3), 315-327, 2002 | 23 | 2002 |

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 | 21 | 2012 |

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

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 | 20 | 2007 |

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

Unbordered factors and Lyndon words JP Duval, T Harju, D Nowotka Discrete mathematics 308 (11), 2261-2264, 2008 | 17 | 2008 |

Periodicity and Unbordered Words: A Proof of Duval’s Conjecture T Harju, D Nowotka Annual Symposium on Theoretical Aspects of Computer Science, 294-304, 2004 | 17 | 2004 |