Partial words and a theorem of Fine and Wilf revisited
Authors:
- F. Blanchet-SadriFBF. Blanchet-Sadri
- Robert A. HegstromRHRobert A. Hegstrom
- 1 January 2002
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 270 (1-2) , 401-419
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the combinatorics of finite wordsTheoretical Computer Science, 1999
- Partial words and a theorem of Fine and WilfTheoretical Computer Science, 1999
- Combinatorics of Words1997
- Language Theory and Molecular Genetics: Generative Mechanisms Suggested by DNA Recombination1997
- A possible code in the genetic codeLecture Notes in Computer Science, 1995
- Splicing semigroups of dominoes and DNADiscrete Applied Mathematics, 1991
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviorsBulletin of Mathematical Biology, 1987
- On the syntactic structure of protein sequences and the concept of grammar complexityBulletin of Mathematical Biology, 1984
- Uniqueness theorems for periodic functionsProceedings of the American Mathematical Society, 1965