Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

DFA Minimization Based on Backward Depth Information #11

Open
re-thc opened this issue Jul 19, 2018 · 1 comment
Open

DFA Minimization Based on Backward Depth Information #11

re-thc opened this issue Jul 19, 2018 · 1 comment

Comments

@re-thc
Copy link

re-thc commented Jul 19, 2018

Hi, any chance we can implement https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5091862/ ? It claims to be faster than all the existing methods available. Thanks!

@amoeller
Copy link
Member

Thanks for the pointer! Please note that dk.brics.automaton already supports multiple minimization algorithms, including Valmari's (https://github.com/cs-au-dk/dk.brics.automaton/blob/master/src/dk/brics/automaton/MinimizationOperations.java). The paper you refer to unfortunately only contains an experimental comparison with the Hopcroft algorithm, and the experiments appear to be relatively simple, so it's not clear how well the results generalize.
If you can provide a pull request, that would be great :-)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants