Factorization forests of finite height
Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
Properties of factorization forests
Proceedings of the LITP Spring School on Theoretical Computer Science on Formal properties of finite automata and applications
Varieties Of Formal Languages
On factorization forests of finite height
Theoretical Computer Science
LICS '06 Proceedings of the 21st Annual IEEE 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
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
Efficient evaluation of nondeterministic automata using factorization forests
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Green's relations and their use in automata theory
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Algorithms for regular languages that use algebra
ACM SIGMOD Record
| Hi-index | 0.00 |
We show that for every homomorphism from A+to a finite semigroup Sthere 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 Swith nelements which reaches this bound.