Changes between Initial Version and Version 1 of Ticket #15848


Ignore:
Timestamp:
Mar 12, 2014, 12:07:58 PM (9 years ago)
Author:
Clemens Heuberger
Comment:

New commits:

e5860f5Inserted DocTest: No Simplification for non-deterministic Transducers.
1c123b4Simplification for non-deterministic transducers via Moore's algorithm
4e68645description of equivalent states rewritten
f065517docstring in quotient adapted to the same style as equivalence classes
336de30small changes in docstring of _minimization_Moore_

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #15848

    • Property Status changed from new to needs_review
    • Property Authors changed from Clemens Heuberger to Clemens Heuberger, Daniel Krenn
    • Property Cc Daniel Krenn added
    • Property Branch changed from to u/cheuberg/fsm/moore-non-deterministic
    • Property Commit changed from to 336de301a7510e2005c7302d6aa1ebd796be66d1
  • Ticket #15848 – Description

    initial v1  
    1 In the current implementation, Non-deterministic transducers cannot be simplified via Moore's algorithm.
     1Previously, non-deterministic transducers could not be simplified via
     2Moore's algorithm.  In fact, the old code was already able to do that,
     3but an error was thrown nevertheless.  This check has been moved to
     4minimization of Automata, because it is still required
     5there.
    26
    3 I am preparing a patch and will push it in a few days.
     7Otherwise, the docstrings have been adapted to explain this
     8generalization.
     9
     10Finally, the old docstring of {{{_minimization_Moore_}}} erroneously claimed to
     11run Brzozowski's algorithm, which is now corrected.