Inclusion of Unambiguous RE#s is NP-Hard
Pekka Kilpel\"ainen
TL;DR
Determining inclusion between languages of unambiguous regular expressions with numerical indicators is computationally NP-hard, impacting XML Schema content model validation.
Contribution
This paper proves that inclusion testing for unambiguous RE#s is NP-hard, highlighting computational complexity in schema validation.
Findings
Inclusion testing is NP-hard for unambiguous RE#s.
Complexity holds even under unambiguity constraints.
Implications for XML Schema validation processes.
Abstract
We show that testing inclusion between languages represented by regular expressions with numerical occurrence indicators (RE#s) is NP-hard, even if the expressions satisfy the requirement of "unambiguity", which is required for XML Schema content model expressions.
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
TopicsNatural Language Processing Techniques · Algorithms and Data Compression · Advanced Database Systems and Queries