Regular Languages of Words over Countable Linear Orderings

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.

Domains

Formal Languages and Automata Theory [cs.FL]

Fichier principal

ICALP_2011a.pdf (180.15 Ko)

Origin : Files produced by the author(s)

Gabriele Puppis : Connect in order to contact the contributor

https://hal.science/hal-00717752

Submitted on : Wednesday, October 30, 2013-9:01:55 AM

Last modification on : Friday, March 24, 2023-2:52:55 PM

Long-term archiving on: Friday, January 31, 2014-2:30:19 AM

Dates and versions

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

Identifiers

HAL Id : hal-00717752 , version 1
DOI : 10.1007/978-3-642-22012-8_9

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-PARIS7 CNRS

94 View

166 Download