@typhlosion well they're graphs, so you could brite force it with a backtracking graph traversal
@typhlosion well you want all of them.
@typhlosion it's easy to track different paths through the fsa in parallel w/o back tracking
https://swtch.com/~rsc/regexp/regexp1.html
but if your building strings, don't you kinda need to track the info you could trash when a matching terminates?
@typhlosion each transition yields a character to add to a string.
@confusedcharlot why do people keep making bruteforce suggestions ;w; these are regexes, it should be more straightforward than that