Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
Jorge Miguel Silva

TL;DR
This paper introduces the inner segment measure as a geometric criterion to characterize when the intersection of two context-free languages remains context-free, providing a dichotomy based on boundedness of inner segments.
Contribution
It establishes a geometric characterization of CFL intersections using the inner segment measure, resolving the crossing gap's limitations and providing a complete dichotomy for block-counting CFLs.
Findings
Bounded inner segments imply CFL via finite buffer construction.
Unbounded inner segments with pump-sensitive linkages imply non-CFL.
Complete characterization for block-counting CFLs based on joint well-nestedness.
Abstract
The intersection of two context-free languages is not generally context-free, but no geometric criterion has characterized when it remains so. The crossing gap (max(i'-i, j'-j) for two crossing push-pop arcs) is the natural candidate. We refute this: we exhibit CFLs whose intersection is CFL despite unbounded-gap crossings. The governing quantity is the inner segment measure: for crossing arcs inducing a decomposition w = P1 P2 P3 P4, it is max(|P2|,|P3|), the length of the longer inner segment between interleaved crossing endpoints. We prove a dichotomy for this measure: bounded inner segments imply context-freeness via a finite buffer construction; growing inner segments with pump-sensitive linkages imply non-context-freeness. The inner segment concept applies to all CFL intersections; the strictness of the resulting characterization depends on the language class. For block-counting…
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 · DNA and Biological Computing · Advanced Combinatorial Mathematics
