Palindrome complexity
Authors:
- 1 January 2003
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 292 (1) , 9-31
Abstract
No abstract availableKeywords
All Related Versions
This publication has 36 references indexed in Scilit:
- Singular continuous spectrum for palindromic Schrödinger operatorsCommunications in Mathematical Physics, 1995
- Palindromes in the Fibonacci wordInformation Processing Letters, 1995
- Characterization of two-distance sequencesJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1992
- The number of factors in a paperfolding sequenceBulletin of the Australian Mathematical Society, 1992
- Une nouvelle propriété des suites de Rudin-ShapiroAnnales de l'institut Fourier, 1987
- Sequences with minimal block growthTheory of Computing Systems, 1973
- Uniform tag sequencesTheory of Computing Systems, 1972
- 5304The American Mathematical Monthly, 1966
- Uniqueness theorems for periodic functionsProceedings of the American Mathematical Society, 1965
- The equation $a^M=b^Nc^P$ in a free group.The Michigan Mathematical Journal, 1962