An undecidable property of context-free languages

Details An undecidable property of context-free languages An undecidable property of context-free languages

2010-04-10

arxiv.org/abs/1004.1736v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

We prove that there exists no algorithm to decide whether the language
generated by a context-free grammar is dense with respect to the lexicographic
ordering. As a corollary to this result, we show that it is undecidable whether
the lexicographic orderings of the languages generated by two context-free
grammars have the same order type.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-600483