Fariña Figueredo, Federico
Loading...
Email Address
person.page.identifierURI
Birth Date
Job Title
Last Name
Fariña Figueredo
First Name
Federico
person.page.departamento
Estadística, Informática y Matemáticas
person.page.instituteName
ORCID
person.page.observainves
person.page.upna
Name
- Publications
- item.page.relationships.isAdvisorOfPublication
- item.page.relationships.isAdvisorTFEOfPublication
- item.page.relationships.isAuthorMDOfPublication
2 results
Search Results
Now showing 1 - 2 of 2
Publication Open Access Reduction graph for minimal determinization of fuzzy automata(Springer, 2023-08-21) González de Mendívil Grau, Aitor; Stanimirovic, Stefan; Fariña Figueredo, Federico; Estadística, Informática y Matemáticas; Estatistika, Informatika eta MatematikaWe introduce a minimal determinization procedure for fuzzy finite automata (FfAs) with membership values in a complete residuated lattice (CRL). The method is based on the well-known determinization method via factorization of fuzzy states. However, different to other determinization methods, we do not assume that the CRL is zero divisors free. This fact requires modifying the functions that define the factorization to avoid the zero divisor values when creating the fuzzy states in the determinization procedure. After generating a right-irreducible fuzzy deterministic finite automaton (FDfA) equivalent to the original FfA by determinization via factorization, we construct the so-called reduction graph of this fuzzy automaton, where each arc represents the notion that a fuzzy state is left-reducible by another fuzzy state. By making these left-reductions, we obtain the equivalent minimal FDfA. It is worth mentioning that an empty fuzzy state is always reducible by a nonempty fuzzy state. This behavior, specific for a CRL with zero divisors, has also to be taken into account when the state reduction is carried out.Publication Open Access Minimal determinization algorithm for fuzzy automata(IEEE, 2023) González de Mendívil Grau, Aitor; Stanimirovic, Stefan; Fariña Figueredo, Federico; Estadística, Informática y Matemáticas; Estatistika, Informatika eta MatematikaThe determinization of fuzzy automata is a well-studied problem in theoretical computer science celebrated for its practical applications. Indeed, in the fields of fuzzy discrete event systems, fault diagnosis, clinical monitoring, decision-making systems, and model checking, when a suitable model of a fuzzy automaton is employed, it is desirable to find its language-equivalent deterministic version because of its computational efficiency. Although many methods have been developed to convert a fuzzy automaton to its language equivalent fuzzy deterministic finite automaton (FDfA), they can be applied only for fuzzy automata defined over specific underlying sets of truth values. For example, recently developed determinization methods employ the concept of maximal factorization, which can be defined only on non-locally finite lattices or the Boolean lattice. In addition, not all such determinization methods result in a minimal FDfA. On the other hand, even though such determinization methods have been developed for fuzzy automata over specific underlying structures, these methods cannot be generalized for fuzzy automata over locally finite lattices. This article focuses on filling this gap and develops a novel method for computing a minimal FDfA for a fuzzy automaton defined over a locally finite and divisible residuated lattice. Our method uses the new concept of a reduction graph that emerges from the strict order relation on the resulting fuzzy states, according to which we can construct all minimal FDfAs equivalent to a given fuzzy automaton.