Complementation of Rational Sets on Scattered Linear Orderings
Résumé
In a preceding paper, automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-finite and even transfinite words studied by Buchi Kleene's theorem has been generalized to these words. We prove that rational sets of words on countable scattered linear ordering are closed under complementation using an algebraic approach.
Origine : Fichiers produits par l'(les) auteur(s)