Bispecial factors in circular non-pushy D0L languages K Klouda Theoretical Computer Science 445, 63-74, 2012 | 29 | 2012 |
Rational base number systems for -adic numbers C Frougny, K Klouda RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2012 | 21 | 2012 |
An algorithm for enumerating all infinite repetitions in a D0L-system K Klouda, Š Starosta Journal of Discrete Algorithms 33, 130-138, 2015 | 17 | 2015 |
Characterization of circular D0L-systems K Klouda, Š Starosta Theoretical Computer Science 790, 131-137, 2019 | 16* | 2019 |
Synchronizing delay for binary uniform morphisms K Klouda, K Medková Theoretical Computer Science 615, 12-22, 2016 | 11 | 2016 |
An exact polynomial time algorithm for computing the least trimmed squares estimate K Klouda Computational statistics & data analysis 84, 27-40, 2015 | 10 | 2015 |
Fixed points of Sturmian morphisms and their derivated words K Klouda, K Medková, E Pelantová, Š Starosta Theoretical Computer Science 743, 23-37, 2018 | 9 | 2018 |
Factor complexity of infinite words associated with non-simple Parry numbers K Klouda, E Pelantová Walter de Gruyter GmbH & Co. KG 9 (3), 281-309, 2009 | 9 | 2009 |
Repetitions in Beta-Integers K Klouda, E Pelantová Letters in Mathematical Physics 87, 181-195, 2009 | 5* | 2009 |
Repetitiveness of HD0L-systems K Klouda, Š Starosta arXiv preprint arXiv:2108.11279, 2021 | 2 | 2021 |
The number of primitive words of unbounded exponent in the language of an HD0L-system is finite K Klouda, Š Starosta Journal of Combinatorial Theory, Series A 206, 105904, 2024 | | 2024 |
FACTOR AND PALINDROMIC COMPLEXITY OF THUE-MORSE’S AVATARS C Frougny, K Klouda České vysoké učení technické v Praze, 2013 | | 2013 |
AAMP VIII AND ISCAMI 2011 K Klouda, Z Masáková, R Mesiar, M Štěpnička Kybernetika 48 (3), 357-360, 2012 | | 2012 |
Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers L Balková, K Klouda, E Pelantová arXiv preprint arXiv:1007.2724, 2010 | | 2010 |