Scattered Context-Free Linear Orderings

DOI10.1007/978-3-642-22321-1_19MaRDI QIDQ5199966zbMATH OpenOpenAlexFDO

Authors Zoltán Ésik

Publication date 29 July 2011

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22321-1_19

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 7453084
• Hausdorff rank of scattered context-free linear orders
• Scattered linear orderings with no computable presentation
• Tree-automatic scattered linear orders
• THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
• Algebraic characterization of FO for scattered linear orderings
• The metamathematics of scattered linear orderings
• Equimorphism invariants for scattered linear orderings
• The order type of scattered context-free orderings of rank one is computable
• scientific article; zbMATH DE number 1929934

Cited in

(6)

• A note on ordinal DFAs
• The ordinal generated by an ordinal grammar is computable
• The order type of scattered context-free orderings of rank one is computable
• scientific article; zbMATH DE number 7453084 (Why is no real title available?)
• Factorisation Forests for Infinite Words
• THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS

This page was built for publication: Scattered Context-Free Linear Orderings

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