Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank
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 show that deterministic automata do not have the same expressive power. Despite this negative result, we prove that rational sets of words of finite ranks are closed under complementation.
Origine : Fichiers produits par l'(les) auteur(s)