Factorization forests of finite height
Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
Semigroups and Combinatorial Applications
Semigroups and Combinatorial Applications
The Height of Factorization Forests
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Equations Defining the Polynomial Closure of a Lattice of Regular Languages
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Factorization forests for infinite words and applications to countable scattered linear orderings
Theoretical Computer Science
On first-order fragments for words and Mazurkiewicz traces: a survey
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Deciding the Value 1 Problem for Probabilistic Leaktight Automata
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Factorisation forests for infinite words application to countable scattered linear orderings
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
A combinatorial theorem for trees applications to monadic logic and infinite structures
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 5.23 |
Simon (Theoret. Comput. Sci. 72 (1990) 65-94) has proved that every morphism from a free semigroup to a finite semigroup S admits a Ramseyan factorization forest of height at most 9|s|. In this paper, we prove the same result of Simon with an improved bound of 7|S|. We provide a simple algorithm for constructing a factorization forest. In addition, we show that the algorithm cannot be improved significantly. We give examples of semigroup morphism such that any Ramseyan factorization forest for the morphism would require a height not less than |S|.