#16061: New method intersection (for automata and transducers) and new behavior
of
cartesian_product for transducers
-----------------------------+----------------------------------------
Reporter: skropf | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.2
Component: combinatorics | Keywords: finite_state_machine
Merged in: | Authors: Sara Kropf
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies: #16016
Stopgaps: |
-----------------------------+----------------------------------------
Intersection now constructs the automaton (or transducer) which accepts
(computes) the intersection
of the languages of the given automata (transducers). This was earlier
done by cartesian_product. A given input is accepted if it was accepted by
both given finite state machines. Furthermore, for transducers, the output
has to be same in both given transducer. Furthermore, transitions with
empty input (or output, for transducers) are not allowed.
For an automaton, cartesian_product does the same as intersection. But for
transducers, it
returns a transducer which computes the pairs of output labels of the
given transducer with a given input.
Thus, the output sequences of both given transducers for a given input are
combined into a sequence of pairs of outputlabels.
A deprecation warning is given when Transducer.cartesian_product is called
as the output has changed substantially.
--
Ticket URL: <http://trac.sagemath.org/ticket/16061>
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.
