Factorization forests of finite height (Q908712)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:908712 |
scientific article; zbMATH DE number 4135417
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Factorization forests of finite height |
scientific article; zbMATH DE number 4135417 |
Statements
Factorization forests of finite height (English)
0 references
1990
0 references
We introduce factorization forests. It is shown that the vertex set of a dense factorization forest of finite height satisfies a bounded gap Ramsey-type property of words. The main result is that every morphism from a free semigroup to a finite semigroup S admits a Ramseyan factorization forest of height at most \(9| S|\). Technique for constructing factorization forests are developed.
0 references
factorization
0 references
Ramsey-type property of words
0 references
free semigroup
0 references
0 references
0.8858430981636047
0 references
0.8428044319152832
0 references
0.8153893947601318
0 references
0.7781088352203369
0 references
