State Elimination Ordering Strategies: Some Experimental Results
Nelma Moreira ( Universidade do Porto), Davide Nabais (Universidade do, Porto), Rog\'erio Reis (Universidade do Porto)
TL;DR
This paper evaluates existing and new heuristic strategies for converting finite automata to regular expressions, focusing on their effectiveness through experimental comparisons on randomly generated automata.
Contribution
It introduces new heuristic methods and provides an experimental comparison of various strategies for automata to regular expression conversion.
Findings
Certain heuristics outperform others in specific automata sizes
New heuristics show promising results in reducing conversion complexity
Experimental results highlight the trade-offs between different strategies
Abstract
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to regular expressions have an exponential blow-up in the worst-case. To overcome this, simple heuristic methods have been proposed. In this paper we analyse some of the heuristics presented in the literature and propose new ones. We also present some experimental comparative results based on uniform random generated deterministic finite automata.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.