Sciweavers

Share
FCT
2007
Springer

Factorisation Forests for Infinite Words

9 years 12 months ago
Factorisation Forests for Infinite Words
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. We provide two improvements to the standard result. First we improve on all previously known bounds for the standard theorem. Second, we extend it to every `complete linear ordering'. We use this variant in a simplified proof of complementation of automata over words of countable scattered domain.
Thomas Colcombet
Added 16 Aug 2010
Updated 16 Aug 2010
Type Conference
Year 2007
Where FCT
Authors Thomas Colcombet
Comments (0)
books