A context-free linear ordering with an undecidable first-order theory - Theoretical Computer Science Access content directly
Conference Papers Year : 2012

A context-free linear ordering with an undecidable first-order theory

Arnaud Carayol

Abstract

The words of a context-free language, ordered by the lexicographic ordering, form a context-free linear ordering. It is well-known that the linear orderings associated with deterministic context-free languages have a decidable monadic second-order theory. In stark contrast, we give an example of a context-free language whose lexicographic ordering has an undecidable first-order theory.
Fichier principal
Vignette du fichier
978-3-642-33475-7_8_Chapter.pdf (337.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00733458 , version 1 (04-07-2017)

Licence

Attribution

Identifiers

Cite

Arnaud Carayol, Zoltan Esik. A context-free linear ordering with an undecidable first-order theory. 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.104-118, ⟨10.1007/978-3-642-33475-7_8⟩. ⟨hal-00733458⟩
181 View
177 Download

Altmetric

Share

Gmail Facebook X LinkedIn More