20 citations · 133 across the 31 of their papers we have counts for
Showing 2013 · math.COShow all
3 papers · 2 filters
math.CO2013
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…
math.CO2013★ 14 cited
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…
math.CO2013★ 7 cited
Palindromic closures using multiple antimorphisms
Tatiana Jajcayová, Edita Pelantová, Štěpán Starosta
Generalized pseudostandard word , as introduced in 2006 by de Luca and De Luca, is given by a directive sequence of letters from an alphabet and by a directive se…