10 May
2019
10 May
'19
12:01 p.m.
On Fri, May 10, 2019 at 11:32 AM Victor Khomenko <victor.khomenko@newcastle.ac.uk> wrote:
Hi Alexandre,
I've reconsidered first_match, apparently my suggestion to eliminate the exit arcs of the accepting states in the NFA is wrong, e.g. for (a|a;a) the NFA has two accepting states with no exit arcs and the transformation does not have any effect, whereas first_match(a|a;a)=a. I guess the automaton has to be determinised before applying this transformation (unless you have a better idea).
Don't worry, everything inside first_match is translated in deterministic mode. -- Alexandre Duret-Lutz