Context-free ordinals
We consider context-free languages equipped with the lexicographic ordering. We show that when the lexicographic ordering of a context-free language is scattered, then its Hausdorff rank is less than
We consider context-free languages equipped with the lexicographic ordering. We show that when the lexicographic ordering of a context-free language is scattered, then its Hausdorff rank is less than $\omega^\omega$. As a corollary of this result we obtain that an ordinal is the order type of a well-ordered context-free language iff it is less than $\omega^{\omega^\omega}$.
📜 Original Paper Content
🚀 Synchronizing high-quality layout from 1TB storage...