Scattered context-free linear orderings

Details Scattered context-free linear orderings Scattered context-free linear orderings

2011-02-04

arxiv.org/abs/1102.0850v2

Computer Science

Formal Languages and Automata Theory

Scientific paper

We show that it is decidable in exponential time whether the lexicographic
ordering of a context-free language is scattered, or a well-ordering.

Affiliated with

Also associated with

No associations

Rating

Scattered context-free linear orderings 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 Scattered context-free linear orderings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scattered context-free linear orderings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-491582