A note on the paper "On Brlek-Reutenauer conjecture"

نویسنده

  • Bojan Basic
چکیده

In this short note we point to an error in the proof of a theorem stated in [L. Balková & E. Pelantová & Š. Starosta, On BrlekReutenauer conjecture, Theoret. Comput. Sci. 412 (2011), 5649– 5655]. By constructing a counterexample, we show that the assertion of the theorem is actually incorrect. Although this theorem is of a technical character, it was used in an argument leading to a corollary of a general interest to the Brlek-Reutenauer conjecture, and thus as a consequence of this note we have that the proof of the mentioned corollary is also flawed. Mathematics Subject Classification (2010): 68R15

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Brlek-Reutenauer conjecture

Brlek and Reutenauer conjectured that any infinite word u with language closed under reversal satisfies the equality 2D(u) = ∑ +∞ n=0 Tu(n) in which D(u) denotes the defect of u and Tu(n) denotes Cu(n + 1) − Cu(n) + 2 − Pu(n + 1) − Pu(n), where Cu and Pu are the factor and palindromic complexity of u, respectively. Brlek and Reutenauer verified their conjecture for periodic infinite words. Usin...

متن کامل

Corrigendum: "On Brlek-Reutenauer conjecture"

Bašić (2012) in [1] pointed to a gap in the proof of Corollary 5.10 in Balková et al. (2011) [2] related to the Brlek–Reutenauer conjecture. In this corrigendum, we correct the proof and show that the corollary remains valid. © 2012 Elsevier B.V. All rights reserved. 1. Corrigendum Brlek and Reutenauer conjectured that any infinite word u with language closed under reversal satisfies the equali...

متن کامل

Proof of Brlek-Reutenauer conjecture

Brlek and Reutenauer conjectured that any in nite word u with language closed under reversal satis es the equality 2D(u) = ∑+∞ n=0 Tu(n) in which D(u) denotes the defect of u and Tu(n) denotes Cu(n + 1) − Cu(n) + 2 − Pu(n + 1) − Pu(n), where Cu and Pu are the factor and palindromic complexity of u, respectively. This conjecture was veri ed for periodic words by Brlek and Reutenauer themselves. ...

متن کامل

Proof of the Brlek-Reutenauer conjecture

Brlek and Reutenauer conjectured that any infinite word u with language closed under reversal satisfies the equality 2D(u) = +∞ n=0 Tu(n) in which D(u) denotes the defect of u and Tu(n) denotes Cu(n + 1) − Cu(n) + 2 − Pu(n + 1) − Pu(n), where Cu and Pu are the factor and palindromic complexity of u, respectively. This conjecture was verified for periodic words by Brlek and Reutenauer themselves...

متن کامل

On highly potential words

We introduce a class of infinite words, called highly potential words because of their seemingly high potential of being a good supply of examples and counterexamples regarding various problems on words. We prove that they are all aperiodic words of finite positive defect, and having their set of factors closed under reversal, thus giving examples Brlek and Reutenauer were looking for. We prove...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 448  شماره 

صفحات  -

تاریخ انتشار 2012