Approximate determinization of fuzzy automata over the product structure by means of approximate weak simulations
In this paper, new improved algorithms for approximate determinization of fuzzy finite automata over the product structure are provided. The algorithms result in fuzzy deterministic and crisp-deterministic fuzzy automata whose fuzzy languages differ from the fuzzy language of the original automaton...
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2026 |
| País: | España |
| Institución: | Universidad Pública de Navarra |
| Repositorio: | Academica-e. Repositorio Institucional de la Universidad Pública de Navarra |
| OAI Identifier: | oai:academica-e.unavarra.es:2454/56652 |
| Acceso en línea: | https://hdl.handle.net/2454/56652 |
| Access Level: | acceso embargado |
| Palabra clave: | Approximate determinization Fuzzy automata |
| Sumario: | In this paper, new improved algorithms for approximate determinization of fuzzy finite automata over the product structure are provided. The algorithms result in fuzzy deterministic and crisp-deterministic fuzzy automata whose fuzzy languages differ from the fuzzy language of the original automaton only for those words that are accepted in the original automaton with a degree lower than the prescribed value, and the difference is also smaller than that prescribed value. In addition, the algorithms produce fuzzy automata that are minimal in the class of all fuzzy automata whose language differs from the original one by less than that prescribed value. Compared with other algorithms for approximate determinization, the proposed algorithms show better efficiency, because the improvement based on the use of approximate weak simulations can significantly reduce the number of intermediate states in the first phase of algorithm implementation. |
|---|