-
Currently, there is only `.process` and `.__call__` in the abstract base class `FiniteStateMachine`. The outputs do not depend on the actual type (automaton/transducer). The aim of this ticket is to…
-
Implement `FSMState.final_word_out` in order to accomodate subsequential transducers in this package. A transducer is said to be subsequential if it is deterministic, every state
is final and it has…
-
At the moment
```
sage: T = transducers.add([0, 1])
```
creates a transducer which adds the values of the input-pair. This is now extended to arbitrary tuple-lengths.
(This came up during the revi…
-
A new transducer generator for sequences given by recursions `a(q^K n + r) = a(q^k n + s_r) + t_r` for some `0
-
Make
```
sage: W = Words([0,1])
sage: inverter(W([0,1,0]))
word: 101
sage: inverter(words.FibonacciWord([0,1]))
word: 1011010110110101101011011010110110101101...
```
work.
See also #18118.
Depend…
-
At the moment, there is a `NotImplementedError` if `FiniteStateMachine._composition_explorative_` is used with a transducer with non-empty final word out.
Furthermore, `_composition_explorative_` c…
-
Delete the deprecation warning and its documentation in Transducer.cartesian_product.
See #16061 for the reasons for this deprecation warning. The deprecation warning was active since #16061 was me…
-
Component: **python3**
Author: **Vincent Klein**
Branch/Commit: **[`29bc1be`](https://github.com/sagemath/sagetrac-mirror/commit/29bc1bee2732174cbe0177651a906f363838e301)**
Reviewer: **Frédéric…
-
Hello!
I'm working on a project and use Pynini/OpenFST to build (in general, non-deterministic) WFSTs. Then I apply input strings to them by using composition operation and then get top-n matches.
…
-
```
3:58:35 PM:
3:58:35 PM: [1307:0x5b527b0] 32119 ms: Mark-sweep (reduce) 2048.1 (2056.8) -> 2047.7 (2056.8) MB, 3.5 / 0.0 ms (+ 15.7 ms in 6 steps since start of marking, biggest step 15.4 ms…