Scattered context-free linear orderings
classification
💻 cs.FL
keywords
context-freescattereddecidableexponentiallanguagelexicographiclinearordering
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.