Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/16140
Nаziv: | Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words | Аutоri: | Bašić, Bojan | Dаtum izdаvаnjа: | 1-јан-2012 | Čаsоpis: | Discrete Applied Mathematics | Sažetak: | In [. Holub, K. Saari, On highly palindromic words, Discrete Appl. Math. 157 (2009) 953959] the authors proposed to measure the degree of "palindromicity" of a binary word w by ratio |rws w|, where the word rws is minimal-palindromicthat is, does not contain palindromic subwords of length greater than |w|2⌉and the length |r|+|s| is as small as possible. It was asked whether the words of a given length n which reach the maximal possible ratio |rws w| among the words of length n are always palindromes. It was further asked whether it can be assumed, w.l.o.g., that r and s are of form 0* or 1*, or at least 0 *1* or 1*0*. We negatively answer these questions, and also one further question of a similar kind. © 2011 Elsevier B.V. All rights reserved. |
URI: | https://open.uns.ac.rs/handle/123456789/16140 | ISSN: | 0166218X | DOI: | 10.1016/j.dam.2011.09.011 |
Nаlаzi sе u kоlеkciјаmа: | PMF Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
4
prоvеrеnо 20.11.2023.
Prеglеd/i stаnicа
25
Prоtеklа nеdеljа
7
7
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.