Regular Languages of Words over Countable Linear Orderings - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Regular Languages of Words over Countable Linear Orderings

Abstract

We develop an algebraic model for recognizing languages of words indexed by countable linear orderings. This notion of recognizability is effectively equivalent to definability in monadic second-order (MSO) logic. The proofs also imply the first known collapse result for MSO logic over countable linear orderings.
Fichier principal
Vignette du fichier
ICALP_2011a.pdf (180.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00717752 , version 1 (30-10-2013)

Identifiers

Cite

Gabriele Puppis, Thomas Colcombet, Olivier Carton. Regular Languages of Words over Countable Linear Orderings. Proceedings of ICALP 2011, 2011, Zurich, Switzerland. pp.125-136, ⟨10.1007/978-3-642-22012-8_9⟩. ⟨hal-00717752⟩

Collections

UNIV-PARIS7 CNRS
94 View
165 Download

Altmetric

Share

Gmail Facebook X LinkedIn More