Abstract
Let A be an alphabet and SP⋄(A) denote the class of all countable N-free partially ordered sets labeled by A, in which chains are scattered linear orderings and antichains are finite. We characterize the rational languages of SP⋄(A) by means of logic. We define an extension of monadic second-order logic by Presburger arithmetic, named P-MSO, such that a language L of SP⋄(A) is rational if and only if L is the language of a sentence of P-MSO, with effective constructions from one formalism to the other. As a corollary, the P-MSO theory of SP⋄(A) is decidable.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
