Context-free ordinals

Details Context-free ordinals Context-free ordinals

2011-03-28

arxiv.org/abs/1103.5421v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

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}$.

Affiliated with

Also associated with

No associations

Rating

Context-free ordinals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Context-free ordinals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Context-free ordinals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-707774