#16143: finite_state_machine: Add an example on the Gray code into the
documentation
-------------------------------------+-------------------------------------
Reporter: cheuberg | Owner:
Type: enhancement | Status: new
Priority: minor | Milestone: sage-6.2
Component: combinatorics | Keywords:
Merged in: | finite_state_machine
Reviewers: | Authors: Clemens Heuberger
Work issues: | Report Upstream: N/A
Commit: | Branch:
6145b1f679ef60d78f888df417ed1591880c3d10| u/cheuberg/fsm/example_gray_code
Stopgaps: | Dependencies:
-------------------------------------+-------------------------------------
As an example on how to use cartesian products of transducers as
introduced in #16061, a transducer converting standard binary expansion
into Gray code is constructed by emulating the standard algorithm by
xoring the the standard binary expansion with its shifted version.
The class collecting common transducers introduced in #16141 now also has
a (hard-coded) version of the same transducer and it is made sure that
both transducers agree.
--
Ticket URL: <http://trac.sagemath.org/ticket/16143>
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.
