#15267: automaton: iterator over words of language
-------------------------------------------------+-------------------------
Reporter: dkrenn | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.13
Component: combinatorics | Resolution:
Keywords: automata, finite state | Merged in:
machines, language, iterator | Reviewers:
Authors: | Work issues:
Report Upstream: N/A | Commit:
Branch: | Stopgaps:
Dependencies: #15078 |
-------------------------------------------------+-------------------------
Description changed by dkrenn:
Old description:
> Add a method {{{language(self, n, initial_state)}}} to
> {{{FiniteStateMachine}}} which returns an iterator over all words of
> length n recognized by the automaton/finite state machine.
>
> See also ticket:15078#comment:10.
New description:
Add a method {{{language(self, n, initial_state)}}} to
{{{FiniteStateMachine}}} which returns an iterator over all words of
length n recognized by the automaton/finite state machine. Possibly, use
{{{sage.combinat.words}}}.
See also ticket:15078#comment:10.
--
--
Ticket URL: <http://trac.sagemath.org/ticket/15267#comment:1>
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.
