Scattered context-free linear orderings
Zoltan Esik
TL;DR
This paper proves that it is decidable within exponential time whether the lexicographic ordering of a context-free language is scattered or a well-ordering, advancing understanding of order properties in formal languages.
Contribution
It establishes the decidability and complexity bounds for determining scatteredness and well-ordering in lexicographic orderings of context-free languages.
Findings
Decidability in exponential time for scatteredness and well-ordering
Characterization of lexicographic orderings of context-free languages
Advancement in formal language order property analysis
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Algorithms and Data Compression · Logic, programming, and type systems