Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Julian Pape-Lange"'
Autor:
Julian Pape-Lange
Publikováno v:
International Journal of Foundations of Computer Science. 34:321-345
For [Formula: see text], maximal [Formula: see text]-repetitions ([Formula: see text]-subrepetitions) are fractional powers in strings with exponent of at least [Formula: see text] (and [Formula: see text], respectively) which are non-extendable with
Autor:
Julian Pape-Lange
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783030681944
LATA
LATA
Cadences are structurally maximal arithmetic progressions of indices corresponding to equal characters in an underlying string.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94ba66f2531f9081f2ac3376f5ec2a9c
https://doi.org/10.1007/978-3-030-68195-1_26
https://doi.org/10.1007/978-3-030-68195-1_26
Autor:
Julian Pape-Lange
Publikováno v:
Developments in Language Theory ISBN: 9783030815073
DLT
DLT
For \(\delta \in \mathbb {R}^+\), maximal \(\delta \)-repetitions (\(\delta \)-subrepetitions) are fractional powers with exponent of at least \(2+\delta \) (and \(1+\delta \), respectively) which are non-extendable with respect to their minimum peri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03f476355a4a5b102161f28c70625684
https://doi.org/10.1007/978-3-030-81508-0_26
https://doi.org/10.1007/978-3-030-81508-0_26