bounded delay
Recently Published Documents


TOTAL DOCUMENTS

143
(FIVE YEARS 4)

H-INDEX

15
(FIVE YEARS 0)

Axioms ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 306
Author(s):  
Ludwig Staiger

A quasiperiod of a finite or infinite string is a word whose occurrences cover every part of the string. An infinite string is referred to as quasiperiodic if it has a quasiperiod. We present a characterisation of the set of infinite strings having a certain word q as quasiperiod via a finite language Pq consisting of prefixes of the quasiperiod q. It turns out its star root Pq* is a suffix code having a bounded delay of decipherability. This allows us to calculate the maximal subword (or factor) complexity of quasiperiodic infinite strings having quasiperiod q and further to derive that maximally complex quasiperiodic infinite strings have quasiperiods aba or aabaa. It is shown that, for every length l≥3, a word of the form anban (or anbban if l is even) generates the most complex infinite string having this word as quasiperiod. We give the exact ordering of the lengths l with respect to the achievable complexity among all words of length l.



Author(s):  
Michael Markovitch ◽  
Gabriel Scalosub
Keyword(s):  


2021 ◽  
Vol 49 (2) ◽  
pp. 246-249
Author(s):  
Christoph Dürr ◽  
Shahin Kamali




Algorithmica ◽  
2019 ◽  
Vol 82 (6) ◽  
pp. 1547-1573 ◽  
Author(s):  
Alessio Conte ◽  
Roberto Grossi ◽  
Andrea Marino ◽  
Luca Versari


Author(s):  
Soheil Rostami ◽  
Sandra Lagen ◽  
Mario Costa ◽  
Paolo Dini ◽  
Mikko Valkama


PAMM ◽  
2019 ◽  
Vol 19 (1) ◽  
Author(s):  
Afshin Sattarifar ◽  
Tamara Nestorović


2019 ◽  
Vol 64 (9) ◽  
pp. 3913-3919 ◽  
Author(s):  
Carla de Souza ◽  
Valter J. S. Leite ◽  
Luis F. P. Silva ◽  
Eugenio B. Castelan


2019 ◽  
Vol 776 ◽  
pp. 95-113 ◽  
Author(s):  
Martin Böhm ◽  
Marek Chrobak ◽  
Łukasz Jeż ◽  
Fei Li ◽  
Jiří Sgall ◽  
...  


Sign in / Sign up

Export Citation Format

Share Document