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 infinite-sequences
Search options not deleted
user 141242
2
votes
1
answer
118
views
A second attempt at a two-dimensional Higman's Lemma
Let $A$ be a fixed finite alphabet.
If $s$ and $t$ are finite strings over $A$, define $s\leq t$ if $s$ can be obtained by deleting zero or more characters from $t$. Higman's Lemma states that if $s_1 …
- 23.7k
3
votes
1
answer
217
views
Is there a two-dimensional Higman's lemma?
A string over a finite alphabet $A$ can be thought of as a function
$f:\{1,2,...,m\} \rightarrow A$ for some natural number $m$.
A 2-Dim string over $A$ is a function $f$ where
$f:\{1,2,\ldots,m\}\tim …
