Complementation of Rational Sets on Countable Scattered Linear Orderings

Chloé Rispal (1) , Olivier Carton (2)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

In a preceding paper (Bruyère and Carton, automata on linear orderings, MFCS'01), automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite and even transfinite words studied by Büchi. Kleene's theorem has been generalized to these words. We prove that rational sets of words on countable scattered linear orderings are closed under complementation using an algebraic approach.

Domaines: Algorithme et structure de données [cs.DS]

Chloé Rispal, Olivier Carton. Complementation of Rational Sets on Countable Scattered Linear Orderings. International Journal of Foundations of Computer Science, 2005, 16 (4), pp.767-786. ⟨10.1007/978-3-540-30550-7_32⟩. ⟨hal-00160985⟩