Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
Karel Klouda
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
The asymptotic repetition threshold of sequences rich in palindromes
2025
Ľubomíra Dvořáková
Karel Klouda
Edita Pelantová
+
PDF
Chat
The asymptotic repetition threshold of sequences rich in palindromes
2024
Ľubomíra Dvořáková
Karel Klouda
Edita Pelantová
+
PDF
Chat
The number of primitive words of unbounded exponent in the language of an HD0L-system is finite
2024
Karel Klouda
Štěpán Starosta
+
Repetitiveness of HD0L-systems
2021
Karel Klouda
Štěpán Starosta
+
Repetitiveness of HD0L-systems
2021
Karel Klouda
Štěpán Starosta
+
Characterization of circular D0L-systems
2019
Karel Klouda
Štěpán Starosta
+
Fixed points of Sturmian morphisms and their derivated words
2018
Karel Klouda
Kateřina Medková
Edita Pelantová
Štěpán Starosta
+
PDF
Chat
Synchronizing delay for binary uniform morphisms
2015
Karel Klouda
Kateřina Medková
+
An algorithm for enumerating all infinite repetitions in a D0L-system
2015
Karel Klouda
Štěpán Starosta
+
PDF
Chat
An exact polynomial time algorithm for computing the least trimmed squares estimate
2014
Karel Klouda
+
Characterization of circular D0L systems
2014
Karel Klouda
Štěpán Starosta
+
Characterization of circular D0L systems
2013
Karel Klouda
Štěpán Starosta
+
Bispecial factors in circular non-pushy D0L languages
2012
Karel Klouda
+
PDF
Chat
Rational base number systems for<i>p</i>-adic numbers
2011
Christiane Frougny
Karel Klouda
+
Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers
2010
Ľubomíra Balková
Karel Klouda
Edita Pelantová
+
Non-standard numeration systemes and combinatorics on words
2010
Karel Klouda
+
Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers
2010
Ľubomíra Balková
Karel Klouda
Edita Pelantová
+
PDF
Chat
Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers
2009
Karel Klouda
Edita Pelantová
+
PDF
Chat
Repetitions in Beta-Integers
2009
Ľubomíra Balková
Karel Klouda
Edita Pelantová
+
Factor complexity of infinite words associated with non-simple Parry numbers
2008
Karel Klouda
Edita Pelantová
+
Factor complexity of infinite words associated with non-simple Parry numbers
2008
Karel Klouda
Edita Pelantová
Common Coauthors
Coauthor
Papers Together
Edita Pelantová
9
Štěpán Starosta
8
Ľubomíra Balková
3
Kateřina Medková
2
Ľubomíra Dvořáková
2
Christiane Frougny
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
An algorithm for enumerating all infinite repetitions in a D0L-system
2015
Karel Klouda
Štěpán Starosta
6
+
PDF
Chat
Sequences with constant number of return words
2008
Ľubomíra Balková
Edita Pelantová
Wolfgang Steiner
4
+
Powers of rationals modulo 1 and rational base number systems
2008
Shigeki Akiyama
Christiane Frougny
Jacques Sakarovitch
3
+
Characterization of circular D0L-systems
2019
Karel Klouda
Štěpán Starosta
3
+
Additive and multiplicative properties of point sets based on beta-integers
2003
Christiane Frougny
Jean‐Pierre Gazeau
Rudolf Krejcar
3
+
PDF
Chat
Automatic sequences of rank two
2022
Jason P. Bell
Jeffrey Shallit
3
+
PDF
Chat
Weakly mixing transformations which are not strongly mixing
1969
R. V. Chacon
3
+
The Index of Sturmian Sequences
2002
David Damanik
Daniel Lenz
3
+
Asymptotic Behavior of Beta-Integers
2008
Ľubomíra Balková
Jean‐Pierre Gazeau
Edita Pelantová
3
+
PDF
Chat
Palindromic complexity of infinite words associated with non-simple Parry numbers
2008
Ľubomíra Balková
Zuzana Masáková
2
+
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
2005
M. Lothaire
2
+
On Critical exponents in fixed points of<i>k</i>-uniform binary morphisms
2007
Dalia Krieger
2
+
None
2000
David Damanik
2
+
PDF
Chat
Initial powers of Sturmian sequences
2006
Valérie Berthé
Charles Holton
Luca Q. Zamboni
2
+
PDF
Chat
Singular continuous spectrum for palindromic Schrödinger operators
1995
At L. Hof
Oliver Knill
Barry Simon
2
+
PDF
Chat
Repetitions in Beta-Integers
2009
Ľubomíra Balková
Karel Klouda
Edita Pelantová
2
+
Bispecial factors in circular non-pushy D0L languages
2012
Karel Klouda
2
+
Combinatorics on words
1984
M. Lothaire
2
+
PDF
Chat
Reconnaissabilité des substitutions et complexité des suites automatiques
1996
Brigitte Mossé
2
+
PDF
Chat
Sturmian jungle (or garden?) on multiliteral alphabets
2010
Ľubomíra Balková
Edita Pelantová
Štěpán Starosta
2
+
PDF
Chat
The equation $a^M=b^Nc^P$ in a free group.
1962
Roger C. Lyndon
M. P. Schützenberger
2
+
On theβ-expansions of real numbers
1960
William Parry
2
+
Computing and Combinatorics
1996
2
+
Subword complexity and power avoidance
2018
Jeffrey Shallit
Arseny M. Shur
2
+
PDF
Chat
Applications and algorithms for least trimmed sum of absolute deviations regression
1999
Douglas M. Hawkins
David J. Olive
1
+
PDF
Chat
Complexity of infinite words associated with beta-expansions
2004
Christiane Frougny
Zuzana Masáková
Edita Pelantová
1
+
PDF
Chat
A connection between palindromic and factor complexity using return words
2008
Michelangelo Bucci
Alessandro De Luca
Amy Glen
Luca Q. Zamboni
1
+
Languages of <i>k</i> -interval exchange transformations
2008
Sébastien Ferenczi
Luca Q. Zamboni
1
+
PDF
Chat
Sturmian morphisms, the braid group B 4, Christoffel words and bases of F 2
2006
Christian Kassel
Christophe Reutenauer
1
+
PDF
Chat
Functional iteration and the Josephus problem
1991
Andrew Odlyzko
Herbert S. Wilf
1
+
Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers
2010
Ľubomíra Balková
Karel Klouda
Edita Pelantová
1
+
PDF
Chat
Relation between powers of factors and the recurrence function characterizing Sturmian words
2009
Zuzana Masáková
Edita Pelantová
1
+
Robust Regression and Outlier Detection
1989
Gregory F. Piepel
Peter J. Rousseeuw
Annick M. Leroy
1
+
On minimal factorizations of words as products of palindromes
2012
Anna E. Frid
Svetlana Puzynina
Luca Q. Zamboni
1
+
PDF
Chat
A proof of Dejean’s conjecture
2010
James D. Currie
Narad Rampersad
1
+
Least Median of Squares Regression
1984
Peter J. Rousseeuw
1
+
PDF
Chat
An unsolved problem on the powers of 3/2
1968
K. Mahler
1
+
An effect solution to the DOL periodicity problem in the binary case.
1988
Patrice Séébold
1
+
The least trimmed squares. Part I: Consistency
2006
Jan Ámos Vı́šek
1
+
Robust Regression and Outlier Detection
1987
Peter J. Rousseeuw
Annick M. Leroy
1
+
Über eine neue Begründung der Theorie der algebraischen Zahlen.
1897
Kurt Hensel
1
+
PDF
Chat
On the Number of Rich Words
2017
Josef Rukavicka
1
+
PDF
Chat
Palindromic richness
2008
Amy Glen
Jacques Justin
Steve Widmer
Luca Q. Zamboni
1
+
PDF
Chat
A characterization of substitutive sequences using return words
1998
Fabien Durand
1
+
Critical exponents of infinite balanced words
2018
Narad Rampersad
Jeffrey Shallit
Élise Vandomme
1
+
PDF
Chat
Decidability of the HD<b>0</b>L ultimate periodicity problem
2013
Fabien Durand
1
+
PDF
Chat
On Morphisms Preserving Palindromic Richness
2022
Francesco Dolce
Edita Pelantová
1
+
PDF
Chat
Episturmian words: a survey
2009
Amy Glen
Jacques Justin
1
+
Infinite words with finite defect
2011
Ľubomíra Balková
Edita Pelantová
Štěpán Starosta
1
+
PDF
Chat
A Set of Sequences of Complexity $$2n+1$$ 2 n + 1
2017
Julien Cassaigne
Sébastien Labbé
Julien Leroy
1