Inclusion of Unambiguous RE#s is NP-Hard

Details Inclusion of Unambiguous RE#s is NP-Hard Inclusion of Unambiguous RE#s is NP-Hard

2011-11-02

arxiv.org/abs/1111.0422v1

Computer Science

Computational Complexity

2 pages; unpublished; "Unambiguity" is also known as "weak determinism"; The paper actually shows the co-NP-hardness of the pr

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Inclusion of Unambiguous RE#s is NP-Hard does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Inclusion of Unambiguous RE#s is NP-Hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inclusion of Unambiguous RE#s is NP-Hard will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-327739