Karel Klouda

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The number of primitive words of unbounded exponent in the language of an HD0L-system is finite Journal of Combinatorial Theory. Series A	2024-05-24	Paper
Characterization of circular D0L-systems Theoretical Computer Science	2019-09-10	Paper
An exact polynomial time algorithm for computing the least trimmed squares estimate Computational Statistics and Data Analysis	2018-11-23	Paper
Fixed points of Sturmian morphisms and their derivated words Theoretical Computer Science	2018-08-23	Paper
Synchronizing delay for binary uniform morphisms Theoretical Computer Science	2016-01-21	Paper
An algorithm for enumerating all infinite repetitions in a D0L-system Journal of Discrete Algorithms	2015-08-18	Paper
Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers Integers	2013-10-25	Paper
Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers Integers	2013-10-25	Paper
Rational base number systems for \(p\)-adic numbers RAIRO. Theoretical Informatics and Applications	2012-08-31	Paper
Bispecial factors in circular non-pushy D0L languages Theoretical Computer Science	2012-08-10	Paper
BSA - exact algorithm computing LTS estimate (available as arXiv preprint)	2010-01-08	Paper
Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers INTEG	2009-10-16	Paper
Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers INTEG	2009-10-16	Paper
Repetitions in beta-integers Letters in Mathematical Physics	2009-04-20	Paper
The number of primitive words of unbounded exponent in the language of an HD0L-system is finite (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: Karel Klouda