Lookahead DFAs are used during parsing for sake of resolving conflicts (as described in more detail in the introduction). The parsing of an input string w may require many DFA-explorations starting from different letter positions. This raises the question how many of these explorations can be active at the same time. If there is a bound on this number depending on the given DFA M only (i.e., th...
