Approximate children fuzzy automata over the product structure
Open Access
- 1 January 2026
- journal article
- Published by National Library of Serbia in Filomat
- Vol. 40 (1) , 309-320
Abstract
The general problem of determinization of fuzzy automata over the product structure is un-solvable, which necessitates the use of approximate methods. This paper introduces a new approach to the approximate determinization of fuzzy finite automata by utilizing a transition to a different structure, known as the truncated product structure. This structure is residuated and has a locally finite semiring reduct, which enables efficient computation. The proposed method constructs a so-called Children automa-ton and employs approximate weak simulations to achieve more effective determinization. In comparison to existing techniques, this approach significantly enhances the performance and precision of the resulting crisp-deterministic fuzzy automata.Keywords
Funding Information
- Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja (451-03-137/2025-03/200124)
This publication has 21 references indexed in Scilit:
- Reduction Graph for Minimal Determinization of Fuzzy Automata2023
- Canonization of max-min fuzzy automataFuzzy Sets and Systems, 2019
- A generalization of Myhill–Nerode theorem for fuzzy languagesFuzzy Sets and Systems, 2016
- Further improvements of determinization methods for fuzzy finite automataFuzzy Sets and Systems, 2016
- Brzozowski type determinization for fuzzy automataFuzzy Sets and Systems, 2014
- Some new approaches to constructing similarity measuresFuzzy Sets and Systems, 2014
- Myhill–Nerode type theory for fuzzy languages and automataFuzzy Sets and Systems, 2010
- Fuzzy Languages2009
- Handbook of Weighted Automata2009
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoidsFuzzy Sets and Systems, 2005