A Kleene Theorem for Languages of Words Indexed by Linear Orderings

Alexis Bès (1) , Olivier Carton (2)

1 LACL - Laboratoire d'Algorithmique Complexité et Logique
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

In a preceding paper, Bruyère and Carton introduced automata, as well as rational expressions, which allow to deal with words indexed by linear orderings. A Kleene-like theorem was proved for words indexed by countable scattered linear orderings. In this paper we extend this result to languages of words indexed by all linear orderings.

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

Alexis Bès, Olivier Carton. A Kleene Theorem for Languages of Words Indexed by Linear Orderings. International Journal of Foundations of Computer Science, 2006, 17 (3), pp.519-542. ⟨hal-00160976⟩