2000 character limit reached
Scattered context-free linear orderings
Published 4 Feb 2011 in cs.FL | (1102.0850v2)
Abstract: We show that it is decidable in exponential time whether the lexicographic ordering of a context-free language is scattered, or a well-ordering.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
