#19454: FiniteStateMachine: automatic determinisation of alphabets is
inconsistent
-------------------------------------+-------------------------------------
Reporter: cheuberg | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-6.10
Component: finite state machines | Keywords:
Merged in: | Authors: Clemens Heuberger
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-------------------------------------+-------------------------------------
If a finite state machine is determined by a transition function, the
output alphabet usually turns out to be `None`, which contrasts the
default behaviour for other construction methods.
{{{
sage: def transition_function(state, letter):
....: return (0, 3 + letter)
sage: T1 = Transducer(transition_function,
....: input_alphabet=[0, 1],
....: initial_states=[0],
....: final_states=[0])
sage: T1.output_alphabet is None
True
sage: T2 = Transducer([(0, 0, 0, 3), (0, 0, 0, 4)],
....: initial_states=[0],
....: final_states=[0])
sage: T2.output_alphabet
[3, 4]
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/19454>
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.
