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...

Descripción completa

Detalles Bibliográficos
Autores: Jancic, Zorana, Micic, Ivana, Ciric, Miroslav, González de Mendívil Moreno, José Ramón, Stanimirovic, Stefan
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
id ES_6fc6a640a011398e4ca0d208a23402e9
oai_identifier_str oai:academica-e.unavarra.es:2454/56652
network_acronym_str ES
network_name_str España
repository_id_str
spelling Approximate determinization of fuzzy automata over the product structure by means of approximate weak simulationsJancic, ZoranaMicic, IvanaCiric, MiroslavGonzález de Mendívil Moreno, José RamónStanimirovic, StefanApproximate determinizationFuzzy automataIn 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.Z. Jančić, I. Micić, M. Ćirić, and S. Stanimirović are supported by the Science Fund of the Republic of Serbia, grant no 7750185, Quantitative Automata Models: Fundamental Problems and Applications -QUAM. They are also supported by the Ministry of Science, Technological Development and Innovation, Republic of Serbia, grant no. 451-03-65/2024-01/200124.ElsevierEstadística, Informática y MatemáticasEstatistika, Informatika eta Matematika2026info:eu-repo/semantics/articleinfo:eu-repo/semantics/acceptedVersionapplication/pdfhttps://hdl.handle.net/2454/56652reponame:Academica-e. Repositorio Institucional de la Universidad Pública de Navarrainstname:Universidad Pública de NavarraInglés© 2025 Elsevier B.V. This manuscript version is made available under the CC-BY-NC-ND 4.0.https://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/embargoedAccessoai:academica-e.unavarra.es:2454/566522026-06-17T12:41:47Z
dc.title.none.fl_str_mv Approximate determinization of fuzzy automata over the product structure by means of approximate weak simulations
title Approximate determinization of fuzzy automata over the product structure by means of approximate weak simulations
spellingShingle Approximate determinization of fuzzy automata over the product structure by means of approximate weak simulations
Jancic, Zorana
Approximate determinization
Fuzzy automata
title_short Approximate determinization of fuzzy automata over the product structure by means of approximate weak simulations
title_full Approximate determinization of fuzzy automata over the product structure by means of approximate weak simulations
title_fullStr Approximate determinization of fuzzy automata over the product structure by means of approximate weak simulations
title_full_unstemmed Approximate determinization of fuzzy automata over the product structure by means of approximate weak simulations
title_sort Approximate determinization of fuzzy automata over the product structure by means of approximate weak simulations
dc.creator.none.fl_str_mv Jancic, Zorana
Micic, Ivana
Ciric, Miroslav
González de Mendívil Moreno, José Ramón
Stanimirovic, Stefan
author Jancic, Zorana
author_facet Jancic, Zorana
Micic, Ivana
Ciric, Miroslav
González de Mendívil Moreno, José Ramón
Stanimirovic, Stefan
author_role author
author2 Micic, Ivana
Ciric, Miroslav
González de Mendívil Moreno, José Ramón
Stanimirovic, Stefan
author2_role author
author
author
author
dc.contributor.none.fl_str_mv Estadística, Informática y Matemáticas
Estatistika, Informatika eta Matematika
dc.subject.none.fl_str_mv Approximate determinization
Fuzzy automata
topic Approximate determinization
Fuzzy automata
description 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.
publishDate 2026
dc.date.none.fl_str_mv 2026
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/acceptedVersion
format article
status_str acceptedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/2454/56652
url https://hdl.handle.net/2454/56652
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.rights.none.fl_str_mv © 2025 Elsevier B.V. This manuscript version is made available under the CC-BY-NC-ND 4.0.
https://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/embargoedAccess
rights_invalid_str_mv © 2025 Elsevier B.V. This manuscript version is made available under the CC-BY-NC-ND 4.0.
https://creativecommons.org/licenses/by-nc-nd/4.0/
eu_rights_str_mv embargoedAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
instname:Universidad Pública de Navarra
instname_str Universidad Pública de Navarra
reponame_str Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
collection Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869410532603199488
score 15,812429

Similares en LA Referencia