2000 character limit reached
On the Order Type of Scattered Context-Free Orderings (1909.08543v1)
Published 17 Sep 2019 in cs.FL
Abstract: We show that if a context-free grammar generates a language whose lexicographic ordering is well-ordered of type less than $\omega2$, then its order type is effectively computable.