Analyzing Matching Time Behavior Of Backtracking Regular Expression Matchers By Using Ambiguity Of Nfa

We apply results from ambiguity of non-deterministic finite automata to the problem of determining the asymptotic worst-case matching time, as a function of the length of the input strings, when attempting to match input strings with a given regular expression, where the matcher being used is a backtracking regular expression matcher.