On the Order Type of Scattered Context-Free Orderings
Abstract
We show that if a context-free grammar generates a language whose lexicographic ordering is well-ordered of type less than ω2, then its order type is effectively computable.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.