The Order Type of Scattered Context-Free Orderings of Rank One Is Computable

DOI10.1007/978-3-030-38919-2_23zbMath1440.68155arXiv1907.11573OpenAlexW3004242949MaRDI QIDQ3297776

Szabolcs Iván, Kitti Gelle

Publication date: 20 July 2020

Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.11573

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Total orders (06A05)

Cites Work

• The equational theory of regular words
• An undecidable property of context-free linear orders
• Isomorphism of regular trees and words
• The ordinal generated by an ordinal grammar is computable
• Hausdorff Rank of Scattered Context-Free Linear Orders
• Algebraic Ordinals
• Scattered Context-Free Linear Orderings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Order Type of Scattered Context-Free Orderings of Rank One Is Computable