-
-
Notifications
You must be signed in to change notification settings - Fork 528
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
New method intersection (for automata and transducers) and new behavior of cartesian_product for transducers #16061
Milestone
Comments
Last 10 new commits:
|
Commit: |
comment:2
summary:
Therefore, this is a positive review for me. |
Reviewer: Daniel Krenn |
Changed branch from u/skropf/fsm/cartesian-product-intersection to |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Depends on #16016
CC: @dkrenn @cheuberg @seblabbe
Component: combinatorics
Author: Sara Kropf
Branch/Commit:
7633cac
Reviewer: Daniel Krenn
Issue created by migration from https://trac.sagemath.org/ticket/16061
The text was updated successfully, but these errors were encountered: