Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Kristina Ago"'
Autor:
Bojan Bašić, Kristina Ago
Publikováno v:
Discrete Applied Mathematics. 304:98-109
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c410165ddd0e7ea7f569db0ceec1fcd
https://doi.org/10.1016/j.dam.2021.07.020
https://doi.org/10.1016/j.dam.2021.07.020
Publikováno v:
Theoretical Computer Science. 849:184-196
The number of palindromic factors of a given finite word is bounded above by its length increased by 1. The difference between this upper bound and the actual number of palindromic factors of a given word is called the palindromic defect (or only def
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d472f7471458fadb2a7ef7739aaf0ba9
https://doi.org/10.1016/j.tcs.2020.10.022
https://doi.org/10.1016/j.tcs.2020.10.022
Autor:
Kristina Ago, Bojan Bašić
Publikováno v:
Discrete Applied Mathematics. 284:434-443
An n -ary word is called minimal-palindromic if it does not contain palindromic subwords of length greater than ⌈ | w | n ⌉ . The MP-ratio of a given n -ary word w is defined as the quotient | r w s | | w | , where r and s are words such that the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b4ae4d94e2d728d11fedfd603e6374d6
https://doi.org/10.1016/j.dam.2020.04.006
https://doi.org/10.1016/j.dam.2020.04.006
Autor:
Bojan Bašić, Kristina Ago
Publikováno v:
Advances in Applied Mathematics. 134:102302
Given a binary word that contains two (not necessarily disjont) subpalindromes whose total length is large enough (in a certain sense), we show an upper bound (less than 1) on the ratio between the number of occurrences of its less frequent letter an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10023d1983f6269050a72e7f6fbf970d
https://doi.org/10.1016/j.aam.2021.102302
https://doi.org/10.1016/j.aam.2021.102302