Sciweavers

Share
TCS
2010

Factorization forests for infinite words and applications to countable scattered linear orderings

8 years 2 months ago
Factorization forests for infinite words and applications to countable scattered linear orderings
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `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. Second, we extend it to `every linear ordering'. We use this last variant in a simplified proof of the translation of recognisable languages over countable scattered linear orderings to languages accepted by automata. Key words: Formal languages, semigroups, infinite words, automata, factorization trees
Thomas Colcombet
Added 21 May 2011
Updated 21 May 2011
Type Journal
Year 2010
Where TCS
Authors Thomas Colcombet
Comments (0)
books