Sciweavers

LATIN
2004
Springer

Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank

14 years 5 months ago
Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank
In a preceding paper [6], 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¨uchi. 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.
Olivier Carton, Chloe Rispal
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where LATIN
Authors Olivier Carton, Chloe Rispal
Comments (0)