Zorana Jančić

TL;DR: For a given weighted finite automaton over a strong bimonoid, the reduced Nerode automaton is constructed, which is crisp-deterministic and equivalent to the original weighted automaton with respect to the initial algebra semantics and gives smaller crisp-Deterministic automata than any other known determinization algorithm.

TL;DR: It is shown that there are cases when all previous methods result in infinite automata, while Brzozowski type determinization results in a finite one, as in the case of ordinary nondeterministic automata.

TL;DR: A procedure for computing the greatest right invariant fuzzy quasi-order for a given fuzzy automaton over a complete residuated lattice over the real unit interval [ 0, 1 ] is provided.

TL;DR: This work provides another canonization method for a fuzzy finite automaton A = (A, σ, δ, r) over a complete residuated lattice £, based on the degrees of inclusion of the right fuzzy languages associated with states of A into the left derivatives of the fuzzy language recognized by A.

TL;DR: These methods perform better than all previous determinization methods for fuzzy finite automata, developed by Bźlohlavek 3, Li and Pedrycz 38, Ignjatovic et al. 25, and Jancic and źiric 34.