We consider words indexed by linear orderings. These extend finite,(bi-) infinite words and
words on ordinals. We introduce finite automata and rational expressions for these words …

We consider words indexed by linear orderings. These extend finite,(bi-) infinite words and
words on ordinals. We introduce automata and rational expressions for words on linear …

In this paper, we propose a new method to deal with hybrid systems based on the concept of
the nonstandard analysis and the Büchi's transfinite automata. An essential point of the …

In a preceding paper, Bruyère and the second author introduced automata, as well as
rational expressions, which allow to deal with words indexed by linear orderings. A Kleene …

We investigate properties of locally finite languages introduced by Ressayre (J. Symbolic
Logic 53 (4)(1988) 1009–1026). These languages are defined by locally finite sentences …

Automata on Linear Orderings Page 1 Automata on Linear Orderings Véronique Bruy`ere and
Olivier Carton 1 Institut d’Informatique, Université de Mons-Hainaut, Le Pentagone, 6 avenue du …

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 …

In order to explain the purpose of this paper, we recall briefly how the theory of “rationality”
developed in the last fourty years. The theory of sets of finite strings recognized by finite …

In a preceding paper, Bruyere and Carton introduced automata, as well as rational
expressions, which allow to deal with words indexed by linear orderings. A Kleene-like …