Karel Klouda

According to our database, Karel Klouda authored at least 10 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

The number of primitive words of unbounded exponent in the language of an HD0L-system is finite.

Karel Klouda, Stepán Starosta

J. Comb. Theory, Ser. A, 2024

2019

Characterization of circular D0L-systems.

Karel Klouda, Stepán Starosta

Theor. Comput. Sci., 2019

2018

Fixed points of Sturmian morphisms and their derivated words.

Karel Klouda, Katerina Medková, Edita Pelantová, Stepán Starosta

Theor. Comput. Sci., 2018

2016

Synchronizing delay for binary uniform morphisms.

Karel Klouda, Katerina Medková

Theor. Comput. Sci., 2016

2015

An algorithm for enumerating all infinite repetitions in a D0L-system.

Karel Klouda, Stepán Starosta

J. Discrete Algorithms, 2015

An exact polynomial time algorithm for computing the least trimmed squares estimate.

Karel Klouda

Comput. Stat. Data Anal., 2015

2012

Bispecial factors in circular non-pushy D0L languages.

Karel Klouda

Theor. Comput. Sci., 2012

Special issue: AAMP VIII and ISCAMI 2011.

Karel Klouda, Zuzana Masáková, Radko Mesiar, Martin Stepnicka

Kybernetika, 2012

Rational base number systems for <i>p</i>-adic numbers.

Christiane Frougny, Karel Klouda

RAIRO Theor. Informatics Appl., 2012

2011

Critical Exponent of Infinite Words Coding Beta-Integers Associated with Non-Simple Parry Numbers.

L'ubomíra Balková, Karel Klouda, Edita Pelantová

Integers, 2011