González de Mendívil Moreno, José Ramón
Loading...
Email Address
person.page.identifierURI
Birth Date
Job Title
Last Name
González de Mendívil Moreno
First Name
José Ramón
person.page.departamento
Estadística, Informática y Matemáticas
person.page.instituteName
ISC. Institute of Smart Cities
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 Embargo Finite determinization of fuzzy automata using a parametric product-based t-norm(Elsevier, 2024) Micic, Ivana; Stanimirovic, Stefan; González de Mendívil Moreno, José Ramón; Ciric, Miroslav; Jancic, Zorana; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISCThis paper presents a novel approach for the approximate determinization of fuzzy automata over the product structure. We introduce the parametric modification of the product t-norm in the pre-determinization setting. On the one hand, the behavior of a fuzzy automaton over the parametric t-norm differs from the behavior of the fuzzy automaton over the product t-norm only in words with a degree of acceptance below the given parameter. However, using the parametric t-norm, we obtain an algorithm that outputs a finite minimal deterministic fuzzy automaton whose behavior differs from the starting fuzzy automaton described above. By setting the parameter to a sufficiently small value, the proposed algorithm provides a deterministic fuzzy automaton with behavior that differs insignificantly from the starting fuzzy automaton, as the difference is achieved only for words accepted by the starting fuzzy automaton with an insignificant value. As a tradeoff, the proposed approach provides finite determinization, even when all other determinization methods would result in an infinite deterministic automaton. We support this fact with an illustrative example.Publication Open Access Finite Nerode construction for fuzzy automata over the product algebra(Springer, 2023) Jancic, Zorana; Micic, Ivana; Stanimirovic, Stefan; González de Mendívil Moreno, José Ramón; Ciric, Miroslav; Estadística, Informática y Matemáticas; Estatistika, Informatika eta MatematikaThe Nerode's automaton of a given fuzzy automaton A is a crisp-deterministic fuzzy automaton obtained by determinization of A using the well-known accessible fuzzy subset construction. This celebrated construction of a crisp-deterministic fuzzy automaton has served as a basis for various determinization procedures for fuzzy automata. However, the drawback of this construction is that it may not be feasible when the underlying structure for fuzzy automata is the product algebra because it is not locally finite. This paper provides an alternative way to construct a Nerode-like fuzzy automaton when the input fuzzy automaton is defined over the product algebra. This construction is always finite, since the fuzzy language recognized by this fuzzy automaton has a finite domain. However, this new construction does not accept the same fuzzy language as the initial fuzzy automaton. Nonetheless, it differs only in words accepted to some very small degree, which we treat as irrelevant. Therefore, our construction is an excellent finite approximation of Nerode's automaton.