#15078: new module: finite state machines, automata, transducers
-------------------------------------------------+-------------------------
Reporter: dkrenn | Owner:
Type: enhancement | Status:
Priority: major | needs_review
Component: combinatorics | Milestone: sage-5.12
Keywords: finite state machines, | Resolution:
automaton, transducer | Merged in:
Authors: Clemens Heuberger, Daniel | Reviewers:
Krenn, Sara Kropf | Work issues:
Report Upstream: N/A | Commit:
Branch: | Stopgaps:
Dependencies: |
-------------------------------------------------+-------------------------
Comment (by slabbe):
Nice! I was needing such a class for a while! I don't know if you should
really use sage.combinat.words stuff in your code, maybe in a method `def
language(self, n)` of `FiniteStateMachine` that would return an iterator
over all words of length n recognized by the automaton. Anyhow,
sage.combinat.words will definitively benefits from it, for instance for
representing automatic sequences.
I agree with both comments of vbraun above. The code is well written. Only
small fixes must be done like adding INPUT and OUPUT blocks and follow
Python convention of having one space before and after `=` character
(except for arguments of a function). See PEP 8 at
http://www.python.org/dev/peps/pep-0008/
--
Ticket URL: <http://trac.sagemath.org/ticket/15078#comment:10>
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/groups/opt_out.
