Griebach normal form transformation revisited
Information and Computation
On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
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
Theoretical Computer Science
Hausdorff rank of scattered context-free linear orders
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
On context-free languages of scattered words
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
A context-free linear ordering with an undecidable first-order theory
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |
We show that it is decidable in exponential time whether the lexicographic ordering of a context-free language is scattered, or a well-ordering.