Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings

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.

• Type: Conference
• Year: 2009
• Where: LFCS
• Authors: Nicolas Bedon
• Keywords: Artificial Intelligence, Labelled N-free Posets, LFCS 2009, Scattered Linear Orderings, finite Depth-nilpotent Algebra