Opened 8 years ago
Closed 8 years ago
#15848 closed enhancement (fixed)
Simplification for non-deterministic transducers via Moore's algorithm
Reported by: | cheuberg | Owned by: | |
---|---|---|---|
Priority: | minor | Milestone: | sage-6.2 |
Component: | combinatorics | Keywords: | finite_state_machine |
Cc: | Merged in: | ||
Authors: | Clemens Heuberger, Daniel Krenn | Reviewers: | Daniel Krenn |
Report Upstream: | N/A | Work issues: | |
Branch: | 336de30 (Commits, GitHub, GitLab) | Commit: | 336de301a7510e2005c7302d6aa1ebd796be66d1 |
Dependencies: | Stopgaps: |
Description (last modified by )
Previously, non-deterministic transducers could not be simplified via Moore's algorithm. In fact, the old code was already able to do that, but an error was thrown nevertheless. This check has been moved to minimization of Automata, because it is still required there.
Otherwise, the docstrings have been adapted to explain this generalization.
Finally, the old docstring of _minimization_Moore_
erroneously claimed to
run Brzozowski's algorithm, which is now corrected.
Change History (5)
comment:1 Changed 8 years ago by
- Branch set to u/cheuberg/fsm/moore-non-deterministic
- Cc dkrenn added
- Commit set to 336de301a7510e2005c7302d6aa1ebd796be66d1
- Description modified (diff)
- Status changed from new to needs_review
comment:2 Changed 8 years ago by
- Cc dkrenn removed
- Reviewers set to Daniel Krenn
comment:3 Changed 8 years ago by
- Status changed from needs_review to positive_review
comment:4 Changed 8 years ago by
Docstrings rewritten. Cross-checked by cheuberg.
code looks fine, doctests pass, docu checked, coverage checked
comment:5 Changed 8 years ago by
- Branch changed from u/cheuberg/fsm/moore-non-deterministic to 336de301a7510e2005c7302d6aa1ebd796be66d1
- Resolution set to fixed
- Status changed from positive_review to closed
Note: See
TracTickets for help on using
tickets.
New commits:
Inserted DocTest: No Simplification for non-deterministic Transducers.
Simplification for non-deterministic transducers via Moore's algorithm
description of equivalent states rewritten
docstring in quotient adapted to the same style as equivalence classes
small changes in docstring of _minimization_Moore_