Algorithm for minimizing a transducer.
Algorithm for minimizing a transducer.
(behaviour-classes {omega :omega n :n})The states are grouped by their known behaviour, i.e., by their output value.
The states are grouped by their known behaviour, i.e., by their output value.
(hopcroft-ullman {delta :delta :as T})The Hopcroft-Ullman 1979 textbook minimization algorithm.
The Hopcroft-Ullman 1979 textbook minimization algorithm.
(initial-table classes)Intitialzing the table of non-equivalence for the Hopcroft-Ullman minimization.
Intitialzing the table of non-equivalence for the Hopcroft-Ullman minimization.
(joined-states table)When the Hopcroft-Ullman algorithm finished marking non-equivalences, we extract the remaining non-singleton equivalence classes.
When the Hopcroft-Ullman algorithm finished marking non-equivalences, we extract the remaining non-singleton equivalence classes.
(mark-nonequivalence table pair)Marking a pair in the table as non-equivalent and recursively the pairs that can be distinguished by this pair.
Marking a pair in the table as non-equivalent and recursively the pairs that can be distinguished by this pair.
(minimize-transducer T)Given a transducer T this creates its unique minimal transducer by using the classic Hopcroft-Ullman 1979 minimization algorithm.
Given a transducer T this creates its unique minimal transducer by using the classic Hopcroft-Ullman 1979 minimization algorithm.
(ordered-pairs A)(ordered-pairs A B)Returns all strictly ordered pairs in A, or from A and B. A and B are sets of numbers (or anything that can be compared). Not a direct product! Only returns different entries in pairs.
Returns all strictly ordered pairs in A, or from A and B. A and B are sets of numbers (or anything that can be compared). Not a direct product! Only returns different entries in pairs.
(recode-transducer {delta :delta omega :omega n :n} joined)Recoding a transducer when a minimization algorithm gives the list of of non-singleton equivalence classes.
Recoding a transducer when a minimization algorithm gives the list of of non-singleton equivalence classes.
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 |