Long words: the theory of concatenation and &ohgr;-power
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Automatic linear orders and trees
ACM Transactions on Computational Logic (TOCL)
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Collapsible Pushdown Automata and Recursion Schemes
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
The equational theory of regular words
Information and Computation
Regular and algebraic words and ordinals
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Fundamenta Informaticae
Linear orders in the pushdown hierarchy
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
An undecidable property of context-free linear orders
Information Processing Letters
Isomorphism of regular trees and words
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Scattered context-free linear orderings
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Hausdorff rank of scattered context-free linear orders
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Deciding whether the frontier of a regular tree is scattered
Fundamenta Informaticae
| Hi-index | 0.00 |
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.