Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with combinatorics-on-words
Search options not deleted
user 99278
A branch of combinatorics that focuses on the study of words and formal languages
3
votes
Accepted
Covering sequences of words
Try $w_0 = b$, $w_1 = bab$, $w_2 = baba^2bab$, $w_3 = baba^2baba^3baba^2bab$, and recursively $w_{i+1} = w_ia^{i+1}w_i$.
Then $\displaystyle \limsup_{i \rightarrow \infty} Pr(w_i,a^n) = \lim_{i \rig …
- 399
5
votes
0
answers
1k
views
The functional equation $f(x) = qx + qxf(x) - f(x^2)$
A word (i.e., ordered string of letters) is bifix-free provided it has no proper initial string and terminal string that are identical. For example, the word $ingratiating$ has bifix $ing$, but the wo …
- 399