#### Filter Results:

#### Publication Year

2002

2010

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

The subword complexity of a finite word w of length N is a function which associates to each n ≤ N the number of all distinct subwords of w having the length n. We define the maximal complexity C(w) as the maximum of the subword complexity for n ∈ {1, 2,. .. , N }, and the global maximal complexity K(N) as the maximum of C(w) for all words w of a fixed… (More)

We present a method which displays all palindromes of a given length from De Bruijn words of a certain order, and also a recursive one which constructs all palindromes of length n + 1 from the set of palindromes of length n. We show that the palindrome complexity function, which counts the number of palindromes of each length contained in a given word, has… (More)

- MIRA-CRISTIANA ANISIU, Tycho Brache
- 2002

For a given a monoparametric family of curves f (x, y) = c, we present the partial differential equations satisfied by the potentials V = V (x, y) under whose action a particle of unit mass can describe the curves of the family. Szebehely's equation depends on the total energy of the particle, while Bozis' one relates merely the potential and the given… (More)

- ‹
- 1
- ›