Emergent Mind
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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.