Relations rationnelles infinitaires (Q801688)

In this paper, we build a theory of infinitary rational relations, which is an extension of the theory of finitary rational relations, i.e. sets of K-vectors of finite words which are recognized by finite automata with K tapes, and at the same time an extension theory of infinitary rational languages, i.e. sets of finite and infinite words which are recognized by finite automata (the condition of recognizability of an infinite word is that its reading by the automaton must go through a state, which belongs to a designated subset, infinitely many times). Our main result is a theorem similar to the Kleene theorem about rational languages of finite words: It is proved that the family of relations recognized by finite automata with K tapes is the family of relations obtained from the finite finitary relations with a finite sequence of operations of: union, product, finite star, and infinite star. Then the closure properties of this family of relations are studied.