大类扩展正则表达式的多项式时间匹配检验
A Polynomial Time Match Test for Large Classes of Extended Regular Expressions
摘要：
本文研究了扩展正则表达式的匹配检验问题。我们接近这个NP完全问题，通过引入一种新的变种的双向多头自动机，它揭示了匹配测试的复杂性是由一个隐藏的组合属性的扩展正则表达式，它表明，相应的参数的限制导致丰富的类与多项式时间匹配测试。出于表示的原因，我们使用模式语言的概念来指定扩展的正则表达式。虽然这个决定，正式地说，稍微缩小了我们的结果的范围，我们的概念和结果的扩展到更一般的概念扩展正则表达式是直接的。
英文摘要：
In the present paper, we study the match test for extended regular expressions. We approach this NP-complete problem by introducing a novel variant of two-way multihead automata, which reveals that the complexity of the match test is determined by a hidden combinatorial property of extended regular expressions, and it shows that a restriction of the corresponding parameter leads to rich classes with a polynomial time match test. For presentational reasons, we use the concept of pattern languages in order to specify extended regular expressions. While this decision, formally, slightly narrows the scope of our results, an extension of our concepts and results to more general notions of extended regular expressions is straightforward.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
