#18002: AutomaticMonoid
-------------------------------------+-------------------------------------
Reporter: virmaux | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.6
Component: combinatorics | Resolution:
Keywords: monoids, days64 | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/virmaux/automaticmonoid | bd807f4ccea8565feb8e2984476ee7cb4f18b404
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Description changed by virmaux:
Old description:
> Implement the `AutomaticMonoid` class. It is a rewrite of the sage-
> combinat patch by Nicolas M. Thiéry.
New description:
Implement the `AutomaticMonoid` class. It is a rewrite of the sage-
combinat patch by Nicolas M. Thiéry.
AutomaticMonoid construct (lazily) a monoid from a set of concrete
generators living in an ambient monoid.
Here is a quick exemple from the documentation:
{{{
sage: R = IntegerModRing(12)
sage: M = AutomaticMonoid(Family({1: R(3), 2: R(5)}), one = R.one())
sage: M.cardinality()
4
}}}
--
--
Ticket URL: <http://trac.sagemath.org/ticket/18002#comment:5>
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.
