Logic and bounded width rational languages of posets over…逻辑和有界宽度的合理语言.pdfVIP

Logic and bounded-width rational languages of posets over countable scattered linear orderings Nicolas Bedon Universit´e Paris-Est and CNRS Laboratoire d’informatique de l’Institut Gaspard Monge, UMR CNRS 8049 5, boulevard Descartes, Champs-sur-Marne 77454 Marne-la-Vall´ee Cedex 2 France Nicolas.Bedon@univ-mlv.fr Abstract. In this paper we consider languages of labelled N-free posets over countable and scattered linear orderings. We prove that a language of such posets is series-rational if and only if it is recognizable by a finite depth-nilpotent algebra if and only if it is bounded-width and monadic second-order definable. This extends previous results on languages of labelled N-free finite and ω-posets and on languages of labelled countable and scattered linear orderings. 1 Introduction It is known since the beginning of the 60’s that automata, rational expressions, monadic second-order logic (MSO[]) and finite monoids all have the same ex- pressive power for the definition of languages of finite words. They have been widely studied since that time, and adapted to more complex structures, like infinite words, trees, or partially ordered labelled sets. The subject of this paper is such an extension, from two different directions: languages of infinite words, and languages of posets. Let us cite the works it relies on. First, B¨uchi [6, 7] initiated the study of automata on infinite words, in the meaning that letters are indexed by ordinal numbers, and not just integers as for the finite words case. He successfully used the equivalent expressive power of automata and MSO[] in order to exhibit decision procedures for the deci