Abstract
We show that for every homomorphism from A ∈+∈ to a finite semigroup S there exists a factorization forest of height at most 3|S| - 1. Furthermore, we show that for every non-trivial group, this bound is tight. For aperiodic semigroups, we give an improved upper bound of 2 |S| and we show that for every n ≥ 2 there exists an aperiodic semigroup S with n elements which reaches this bound. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Kufleitner, M. (2008). The height of factorization forests. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5162 LNCS, pp. 443–454). https://doi.org/10.1007/978-3-540-85238-4_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
