@article{Simon199065,
Abstract = {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|. Techniques for constructed factorization forests are developed.},
Author = {Simon, Imre},
File = {Factorization forests of finite height - Simon (0) (0) - a - a - r.pdf},
ISSN = {0304-3975},
Journal = {Theoretical Computer Science},
Number = {1},
Pages = {65 - 94},
Title = {Factorization forests of finite height},
URL = {http://www.sciencedirect.com/science/article/pii/030439759090047L},
Volume = {72},
Year = {1990},
bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/030439759090047L},
bdsk-url-2 = {http://dx.doi.org/10.1016/0304-3975(90)90047-L},
date-added = {2016-01-12 15:06:55 +0000},
date-modified = {2016-01-12 15:06:55 +0000},
doi = {10.1016/0304-3975(90)90047-L}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A