"cb1-60"><a href="#cb1-60" aria-hidden="true" tabindex="-1"></a>An important consideration in parsing with FSAs is ambiguity. A string may have multiple valid parses if the automaton is nondeterministic. In such cases, the parsing algorithm returns the set of all valid parses.</span>
<span id="cb1-61"><a href="#cb1-61" aria-hidden="true" tabindex="-1"></a></span>
<span id="cb1-62"><a href="#cb1-62" aria-hidden="true" tabindex="-1"></a>For example, consider an NFA that recognizes the language $(a|b)^*a(a|b)^