l\sigma\)</span>; otherwise, an indication that no such path exists</li>
</ul>
<p>Note that we’ll focus on nondeterministic finite automata (NFAs) throughout this discussion. This is sufficient because any deterministic finite automaton (DFA) can be represented as an NFA with exactly the same states and transitions, but without any nondeterministic choices or epsilon transitions.</p>
</section>
<section id="parsing-algorithm" class="level3">
<h3 class="anchored" data-anchor-id="parsing-algorithm">Parsing 