Searching for "The Height of Factorization Forests." – sorted by Relevance.
-
A Proof of the Factorization Forest Theorem
- finite semigroup there exists a factorization forest of height ≤ 3 |S|. The proof is based on Green
- Cited by 1 (1 self) – Add To MetaCart
-
On first-order fragments for words and Mazurkiewicz traces: A survey
- to a finite aperiodic monoid M admits a factorization forest of finite height. We include a simple
- Cited by 1 (1 self) – Add To MetaCart

