Hausdorff rank of scattered context-free linear orders

DOI10.1007/978-3-642-29344-3_25zbMATH Open1318.68106OpenAlexW10740967MaRDI QIDQ2894473FDOQ2894473

Authors: Szabolcs Iván, Zoltán Ésik 

Publication date: 29 June 2012

Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29344-3_25

Recommendations

• The order type of scattered context-free orderings of rank one is computable
• On context-free languages of scattered words
• On context-free languages of scattered words
• An undecidable property of context-free linear orders
• A context-free linear ordering with an undecidable first-order theory

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (10)

• The ordinal generated by an ordinal grammar is computable
• On context-free languages of scattered words
• On context-free languages of scattered words
• Algebraic linear orderings
• Scattered Context-Free Linear Orderings
• An undecidable property of context-free linear orders
• THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
• LATIN 2004: Theoretical Informatics
• The order type of scattered context-free orderings of rank one is computable
• A context-free linear ordering with an undecidable first-order theory

This page was built for publication: Hausdorff rank of scattered context-free linear orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894473)