FIXED OUTPUT TRANSDUCER CONSTRUCTION This is the first working version of transducer synthesis so it is somewhat of a legacy code. The input-output pairs need to be given in the internal representation (nonnegative integers) thus the output of the Moore automaton is hardcoded. Consequently, there is the issue of using the initial state 0 as an output which may be a too rigid constraint.
FIXED OUTPUT TRANSDUCER CONSTRUCTION This is the first working version of transducer synthesis so it is somewhat of a legacy code. The input-output pairs need to be given in the internal representation (nonnegative integers) thus the output of the Moore automaton is hardcoded. Consequently, there is the issue of using the initial state 0 as an output which may be a too rigid constraint.
(fixed-output-transducer io-pairs n)Given the the input-output pairs, and the number of states, this attempts to construct a suitable transducer. Both the inputs and the outputs are represented as nonnegative integers. The output delta is a vector of transformations. The first vector is the transformation realized by input symbol 0, second for input symbol 1, and so on. It produces all solutions lazily, so if only a solution is needed, the first one can be used. The output function is the identity.
Given the the input-output pairs, and the number of states, this attempts to construct a suitable transducer. Both the inputs and the outputs are represented as nonnegative integers. The output delta is a vector of transformations. The first vector is the transformation realized by input symbol 0, second for input symbol 1, and so on. It produces all solutions lazily, so if only a solution is needed, the first one can be used. The output function is the identity.
cljdoc builds & hosts documentation for Clojure/Script libraries
| Ctrl+k | Jump to recent docs |
| ← | Move to previous article |
| → | Move to next article |
| Ctrl+/ | Jump to the search field |