execute "(x y z + y z x + z x* y*)* + (x y)*" | string::Parse @RegExp - | ToAutomatonDerivation -
Noticed that in webui logs. It ran for over 3m on my debug build then I terminated it. Probably something to do with regexp optimizations. This should result in a ca. 11-state DFA.
Edited
To upload designs, you'll need to enable LFS and have an admin enable hashed storage. More information
Child items 0
Show closed items
No child items are currently assigned. Use child items to break down this issue into smaller parts.
So the issue is that the regexp parsing "chose" FormalRegExp and optimizations of formal regexps are less capable than optimisations of unbounded regexps. I can force the regexp parsing to chose unbounded regexp and call it a day.
I'll try to figure out what happened in the regexp optimizations algorithm. I have a hunch, something that also affects the unbounded regexp optimization algorithm however not that extremely.
The optimization algorithm is not able to simplify (x + y* z*)* to (x + y + z)*.
Right now the best action is to disable the formal regexp string parser. With the change, only unbounded regexps are produced and it hides the issue. I have to figure out which optimization is missing in the RegExpOptimize of formal regexps...