#19454: FiniteStateMachine: automatic determinisation of alphabets is
inconsistent
-------------------------------------+-------------------------------------
Reporter: cheuberg | Owner:
Type: defect | Status: positive_review
Priority: major | Milestone: sage-6.10
Component: finite state | Resolution:
machines | Merged in:
Keywords: | Reviewers: Daniel Krenn
Authors: Clemens Heuberger | Work issues:
Report Upstream: N/A | Commit:
Branch: u/dkrenn/fsm | 4b8767f4a13612b2ae60e04c43bb2f0c64f32ae4
/transition-function-output- | Stopgaps:
alphabet |
Dependencies: |
-------------------------------------+-------------------------------------
Changes (by cheuberg):
* status: needs_review => positive_review
Comment:
Cross-reviewed your changes. Thanks.
--
Ticket URL: <http://trac.sagemath.org/ticket/19454#comment:7>
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.
