#15925: Use Brzozowski' algorithm as default for minimizing non-deterministic
automata
-------------------------+-------------------------------------------------
Reporter: skropf | Owner:
Type: defect | Status: new
Priority: minor | Milestone: sage-6.2
Component: | Keywords: finite_state_machine
combinatorics | Authors: Clemens Heuberger, Daniel
Merged in: | Krenn, Sara Kropf
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-------------------------+-------------------------------------------------
For a non-deterministic automaton, just merging states which are
indistinguishable for any suffix does not give a minimal non-deterministic
automaton in every case (see e.g. http://cs.stackexchange.com/a/12712 ).
This would be done by Moore's algorithm and only gives a smaller
automaton.
To obtain an equivalent minimal deterministic automaton, we use
Brzozowski's
algorithm, which first computes a determinisation of the non-deterministic
automaton.
--
Ticket URL: <http://trac.sagemath.org/ticket/15925>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
