#19456: FiniteStateMachine: correct is_complete and completion
-------------------------------------+-----------------------------
Reporter: cheuberg | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-6.10
Component: finite state machines | Keywords:
Merged in: | Authors:
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-------------------------------------+-----------------------------
Currently, `is_complete` and `completion` is only `True` if the finite
state machine is almost deterministic (disjoint unions of deterministic
machines are allowed). This shall be corrected.
This also requires fixing of `complement` which silently assumes that
`is_complete` guarantees that the machine is deterministic.
--
Ticket URL: <http://trac.sagemath.org/ticket/19456>
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.
