Skip to main content
Conference Proceedings

Regular languages of words over countable linear orderings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6756 LNCS(PART 2) 125-136
DOI: 10.1007/978-3-642-22012-8_9
15Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Carton, O., Colcombet, T., & Puppis, G. (2011). Regular languages of words over countable linear orderings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6756 LNCS, pp. 125–136). https://doi.org/10.1007/978-3-642-22012-8_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free