Could you point towards a paper that does precise and minimal regular expression (or finite state automaton) inference?
With prompt engineering being so easy, and naive search/refinement over them so easy too, not comparing via benchmarks, vs brush-off related work section, to these general solvers seems strange.