Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/16140
Title: | Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words | Authors: | Bašić, Bojan | Issue Date: | 1-Jan-2012 | Journal: | Discrete Applied Mathematics | Abstract: | 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 |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
4
checked on Nov 20, 2023
Page view(s)
25
Last Week
7
7
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.