Combinatorics of periods in strings
- 1 October 2003
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 104 (1) , 95-113
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- q -gram based database searching using a suffix array (QUASAR)1999
- An interruptible algorithm for perfect sampling via Markov chainsThe Annals of Applied Probability, 1998
- Combinatorics of Words1997
- A Comparison of Approximate String Matching AlgorithmsSoftware: Practice and Experience, 1996
- Theory and application of Marsaglia's monkey test for pseudorandom number generatorsACM Transactions on Modeling and Computer Simulation, 1995
- Monkey tests for random number generatorsComputers & Mathematics with Applications, 1993
- Fast approximate string matchingSoftware: Practice and Experience, 1988
- Periods in stringsJournal of Combinatorial Theory, Series A, 1981
- Accurate estimation of the number of binary partitionsBIT Numerical Mathematics, 1977
- Uniqueness theorems for periodic functionsProceedings of the American Mathematical Society, 1965