无歧义 RE#s 的包含问题是 NP 难的
计算复杂性
2011-11-03 v1
摘要
我们证明了测试由带有数值出现指示符的正则表达式（RE#s）所表示的语言之间的包含性是 NP 难的，即使这些表达式满足“无歧义性”要求（这是 XML Schema 内容模型表达式所必需的）。
引用
@article{arxiv.1111.0422,
title = {Inclusion of Unambiguous RE#s is NP-Hard},
author = {Pekka Kilpeläinen},
journal= {arXiv preprint arXiv:1111.0422},
year = {2011}
}
备注
2 pages; unpublished; "Unambiguity" is also known as "weak determinism"; The paper actually shows the co-NP-hardness of the problem