#16555: FiniteStateMachine.composition: Only deterministic machines for
explorative
algorithm
-------------------------------------+-------------------------------------
Reporter: cheuberg | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-6.3
Component: finite state machines | Keywords:
Merged in: | finite_state_machine
Reviewers: | Authors: Clemens Heuberger
Work issues: | Report Upstream: N/A
Commit: | Branch: u/cheuberg/fsm
d218ba0fdaf2fac6a79324cdaad296fefb3cba1f| /composition-explorative-force-
Stopgaps: | deterministic
| Dependencies: #16191, #16539
-------------------------------------+-------------------------------------
The explorative algorithm for composition of finite state machines only
handles deterministic machines. We now raise a {{{NotImplementedError}}}
instead
of simply taking a more or less random transition.
This is a similar stop-gap measure as #16539.
Once #16538 is implemented, non-deterministic machines shall also be
implemented
in the explorative composition, cf. #16548.
--
Ticket URL: <http://trac.sagemath.org/ticket/16555>
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.
