Learn More
A ((nite) Fibonacci string F n is deened as follows: F 0 = b, F 1 = a; for every integer n 2, F n = F n?1 F n?2. For n 1, the length of F n is denoted by f n = jF n j. The innnite Fibonacci string F is the string which contains every F n , n 1, as a preex. Apart from their general theoretical importance, Fibonacci strings are often cited as worst case(More)
Let x denote a given nonempty string of length n = jxj 1. A string u is a cover of x if and only if every position of x lies within an occurrence of u within x. Thus x is always a cover of itself. In this paper we characterize all the covers of x in terms of an easily computed normal form for x. The characterization theorem then gives rise to a simple(More)
This note corrects an error in a paper recently published in this journal (An optimal algorithm to compute all the covers of a string, IPL 50-5 (1994) 239-246). The correction consists primarily of a new subalgorithm which is called by COMPUTE COVERS, the main algorithm presented in the paper referenced. It turns out that the new subalgorithm is itself(More)
guidance, patience, encouragement, and shared knowledge throughout this study process. In particular, Dr. Rogers' recommendations and suggestions have been invaluable for the project. Embree who have all helped me in the creation of this document. Special thanks should also be given to my student colleagues who helped me in many ways.
INTRODUCTION We investigated whether event-related potentials (ERP) collected in outpatient settings and analyzed with standardized methods can provide a sensitive and reliable measure of the cognitive deficits associated with early Alzheimer's disease (AD). METHODS A total of 103 subjects with probable mild AD and 101 healthy controls were recruited at(More)
  • 1