Knowledge Quiz
Test your understanding of this article
1.What is the well-known time complexity for the standard regular expression matching problem using Thompson's algorithm?
2.Which of the following extensions to regular expressions is NOT among the four considered in this work?
3.Under which conjecture is it proven that none of the matching problems with the considered extensions can be solved in n^(2-ε)poly(m) time?
4.What is the specific name for regular expression matching with the 'complement' extension?
