#16255: FiniteStateMachine.with_final_word_out: New method
-------------------------+-------------------------------------------------
Reporter: cheuberg | Owner:
Type: | Status: new
enhancement | Milestone: sage-6.2
Priority: major | Keywords: finite_state_machine
Component: | Authors: Clemens Heuberger
combinatorics | Report Upstream: N/A
Merged in: | Branch:
Reviewers: | Dependencies: #16145, #16206, #16207,
Work issues: | #16253
Commit: |
Stopgaps: |
-------------------------+-------------------------------------------------
Constructs a finite state machine with final output words for all states
by implicitly reading trailing letters until a final state is reached.
This is e.g. useful for finite state machines operating on digit
expansions: there, it is sometimes required to read a sufficient number of
trailing zeros (at the most significant positions) in order to reach a
final state and to flush all carries. In this case, this method constructs
an essentially equivalent finite state machine in the sense that it not
longer requires adding sufficiently many trailing zeros. However, it is
the responsibility of the user to make sure that if adding trailing zeros
to the input anyway, the output is equivalent.
Patch is in preparation.
--
Ticket URL: <http://trac.sagemath.org/ticket/16255>
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.
