Computer Science – Formal Languages and Automata Theory
Scientific paper
2012-02-28
Computer Science
Formal Languages and Automata Theory
Scientific paper
We prove that the finite condensation rank (FC-rank) of the lexicographic
ordering of a context-free language is strictly less than $\omega^\omega$.
Carayol Arnaud
Esik Zoltan
No associations
LandOfFree
The FC-rank of a context-free language 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 The FC-rank of a context-free language, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The FC-rank of a context-free language will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-612492