Complexity and palindromic defect of infinite words
Authors:
- S. BrlekSBS. Brlek
- C. ReutenauerCRC. Reutenauer
- 1 February 2011
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 412 (4-5) , 493-497
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A connection between palindromic and factor complexity using return wordsAdvances in Applied Mathematics, 2009
- Rich, Sturmian, and trapezoidal wordsTheoretical Computer Science, 2008
- Factor versus palindromic complexity of uniformly recurrent infinite wordsTheoretical Computer Science, 2007
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDSInternational Journal of Foundations of Computer Science, 2004
- A note on differentiable palindromesTheoretical Computer Science, 2003
- Palindrome complexityTheoretical Computer Science, 2003
- Episturmian words and some constructions of de Luca and RauzyTheoretical Computer Science, 2001
- Sur la complexité des suites infiniesBulletin of the Belgian Mathematical Society - Simon Stevin, 1994
- Enumeration of factors in the Thue-Morse wordDiscrete Applied Mathematics, 1989
- Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphismes iteresLecture Notes in Computer Science, 1984