Regular Languages of Words over Countable Linear Orderings - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Regular Languages of Words over Countable Linear Orderings

Résumé

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.

Dates et versions

hal-00439263 , version 1 (07-12-2009)

Identifiants

Citer

Thomas Colcombet, Olivier Carton, Gabriele Puppis. Regular Languages of Words over Countable Linear Orderings. Icalp 2011, Jul 2011, Zürich, Switzerland. pp.125-136, ⟨10.1007/978-3-642-21254-3_1⟩. ⟨hal-00439263⟩
26 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More