19 citations · 59 across the 10 of their papers we have counts for
12 papers
Circularity and repetitiveness in non-injective DF0L systems
Herman Goulet-Ouellet, Karel Klouda, Štěpán Starosta
We study circularity in DF0L systems, a generalization of D0L systems. We focus on two different types of circularity, called weak and strong circularity. When the morphism is inje…
The asymptotic repetition threshold of sequences rich in palindromes
Lubomíra Dvořáková, Karel Klouda, Edita Pelantová
The asymptotic critical exponent measures for a sequence the maximum repetition rate of factors of growing length. The infimum of asymptotic critical exponents of sequences of a ce…
The number of primitive words of unbounded exponent in the language of an HD0L-system is finite
Karel Klouda, Štěpán Starosta
Let be an HD0L-system. We show that there are only finitely many primitive words with the property that , for all integers , is an element of the factorial language…
Fixed points of Sturmian morphisms and their derivated words
Karel Klouda, Kateřina Medková, Edita Pelantová +1
Any infinite uniformly recurrent word can be written as concatenation of a finite number of return words to a chosen prefix of . Ordering of the return words…
Synchronizing delay for binary uniform morphisms
Karel Klouda, Kateřina Medková
Circular D0L-systems are those with finite synchronizing delay. We introduce a tool called graph of overhangs which can be used to find the minimal value of synchronizing delay of…
Characterization of circular D0L systems
Karel Klouda, Štěpán Starosta
We prove that every non-circular D0L system contains arbitrarily long repetitions. This result was already published in 1993 by Mignosi and Séébold, however their proof is only a s…
An Algorithm Enumerating All Infinite Repetitions in a D0L System
Karel Klouda, Štěpán Starosta
We describe a simple algorithm which, for a given D0L system, returns all factors such that is in the language of the system for all . This algorithm can be used to de…
Bispecial factors in circular non-pushy D0L languages
Karel Klouda
We study bispecial factors in fixed points of morphisms. In particular, we propose a simple method of how to find all bispecial words of non-pushy circular D0L-systems. This method…
Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers
L. Balková, K. Klouda, E. Pelantová
In this paper, we study the critical exponent of infinite words $\ubeta$ coding -integers for being a~non-simple Parry number. In other words, we investigate the maximal con…
BSA - exact algorithm computing LTS estimate
Karel Klouda
The main result of this paper is a new exact algorithm computing the estimate given by the Least Trimmed Squares (LTS). The algorithm works under very weak assumptions. To prove th…
Repetitions in beta-integers
L. Balková, K. Klouda, E. Pelantová
Classical crystals are solid materials containing arbitrarily long periodic repetitions of a single motif. In this paper, we study the maximal possible repetition of the same motif…
Factor complexity of infinite words associated with non-simple Parry numbers
Karel Klouda, Edita Pelantová
The factor complexity of the infinite word $\ubeta$ canonically associated to a non-simple Parry number is studied. Our approach is based on the notion of special factors intro…