John Nicol

> Does the reversed NFA essentially represent the complement language? Good question! The complement language \bar{L} is separate from the reversed language L^R. \bar{L} is recognized by just flipping the...

Cool! > As for the triming, maybe we could use some of the existing code. Yes, absolutely. _trim_ is not sophisticated. Half of it just applies a quotient, which is...

>The [Minimizer](https://github.com/LearnLib/automatalib/blob/develop/util/src/main/java/net/automatalib/util/minimizer/Minimizer.java) works on arbitrary UniversalGraphs which NFAs can be transformed to. Oh... does that mean this might already support NFA reduction via "multiple-relation Paige-Tarjan" ?! e.g., [Ilie-Yu], https://www.csd.uwo.ca/~ilie/TisF04.pdf That...

> > We design an algorithm that minimizes irreducible deterministic local automata ... I'm hopeful that it didn't mention NFAs, because technically the algorithm can't "minimize" NFAs (which is NP-hard),...

As an aside, the Beal-Crochemore paper mentions that: "We assume that the automaton is trim, i.e., each state is co-accessible: there is at least one successful path starting from this...

> would be treated as in-equivalent. Oh, I misread that as "equivalent". You're right, that's not what we want.

> it sounds like the algorithm presented in the paper cannot minimize it. Yet, the implementation can. Strange! Actually, originally I was reading a 2008 version of the Beal-Crochemore paper:...

Thanks! I'll create a discussion thread about NFA reductions. Some of the remainder of the goal is original research (and, also, not proven to be correct yet ;-) ), so...

You may want to parameterize this. afaik, not everyone will be able to function with SSH (in the same way that not everyone will be able to function with HTTPS)