combinatorial properties of strings of symbols from a finite alphabet. Also includes sequences such as the Thue-Morse and Rudin-Shapiro sequence.

# Questions tagged [combinatorics-on-words]

332 questions

**-2**

votes

**1**answer

### Number of strings containing each vowel at least once?

Consider the English alphabet {$a,b,c,...,z$}. How many strings of length $n$ can be formed in which each vowel {$a,e,i,o,u$} appears at least once?

user843514

**-2**

votes

**1**answer

### How many strings of length L and n distinct lowercase letters?

Given a set of the lower case alphabet letters {a, b, c, .., z} and two integers n, l.
How many strings of length l are there containing only n distinct letters?
Example:
At n = 2, l=6, some valid strings are:
"ababab", "aaabbb", "accccc", "ccccca"

Youssef Fares

- 33
- 3