2000 character limit reached
On the Order Type of Scattered Context-Free Orderings
Published 17 Sep 2019 in cs.FL | (1909.08543v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
