| The Rauzy gasket P Arnoux, Š Starosta Further developments in fractals and related fields: Mathematical …, 2013 | 47 | 2013 |
| Sturmian Jungle (or Garden?) on multiliteral alphabets L Balkova, E Pelantova, S Starosta Arxiv preprint ArXiv:1003.1224, 2010 | 29 | 2010 |
| Languages invariant under more symmetries: overlapping factors versus palindromic richness E Pelantová, Š Starosta Arxiv preprint arXiv:1103.4051, 2011 | 27 | 2011 |
| Infinite words with finite defect L Balková, E Pelantová, Š Starosta Advances in Applied Mathematics 47 (3), 562-574, 2011 | 18 | 2011 |
| An algorithm for enumerating all infinite repetitions in a D0L-system K Klouda, Š Starosta Journal of Discrete Algorithms 33, 130-138, 2015 | 16 | 2015 |
| Palindromic richness for languages invariant under more symmetries E Pelantová, Š Starosta Theoretical Computer Science 518, 42-63, 2014 | 14 | 2014 |
| On theta-palindromic richness S Starosta Arxiv preprint arXiv:1005.0722, 2010 | 13 | 2010 |
| Characterization of circular D0L-systems K Klouda, Š Starosta Theoretical Computer Science 790, 131-137, 2019 | 12 | 2019 |
| Proof of the Brlek–Reutenauer conjecture E Pelantová, Š Starosta Theoretical Computer Science 475, 120-125, 2013 | 11 | 2013 |
| Generalized Thue-Morse words and palindromic richness Š Starosta Arxiv preprint arXiv:1104.2476, 2011 | 11 | 2011 |
| Palindromic closures using multiple antimorphisms T Jajcayová, E Pelantová, Š Starosta Theoretical Computer Science 533, 37-45, 2014 | 10 | 2014 |
| Fixed points of Sturmian morphisms and their derivated words K Klouda, K Medková, E Pelantová, Š Starosta Theoretical Computer Science 743, 23-37, 2018 | 8 | 2018 |
| Exchange of three intervals: substitutions and palindromicity Z Masáková, E Pelantová, Š Starosta European Journal of Combinatorics 62, 217-231, 2017 | 8 | 2017 |
| Almost rich words as morphic images of rich words E Pelantová, Š Starosta International Journal of Foundations of Computer Science 23 (05), 1067-1083, 2012 | 8 | 2012 |
| Constructions of words rich in palindromes and pseudopalindromes E Pelantová, Š Starosta Discrete Mathematics & Theoretical Computer Science 18 (Combinatorics), 2016 | 7 | 2016 |
| On Brlek-Reutenauer conjecture L Balkov, E Pelantov, S Starosta Theoretical Computer Science, 2011 | 7* | 2011 |
| Formalization of basic combinatorics on words Š Holub, Š Starosta 12th International Conference on Interactive Theorem Proving (ITP 2021), 2021 | 6 | 2021 |
| Palindromes in infinite ternary words E Pelantová, Š Starosta RAIRO-Theoretical Informatics and Applications 43 (04), 687-702, 2009 | 6* | 2009 |
| Morphic images of episturmian words having finite palindromic defect Š Starosta European Journal of Combinatorics 51, 359-371, 2016 | 5 | 2016 |
| Characterization of circular D0L systems K Klouda, Š Starosta arXiv preprint arXiv:1401.0038, 2013 | 5 | 2013 |
Karel KloudaFaculty of Information Technology, Czech Technical University in PragueVerified email at fit.cvut.cz
