Finite determinization of fuzzy automata using a parametric product-based t-norm
From MaRDI portal
Cites work
- A contribution to the determinization of max-plus automata
- A generalization of Myhill-Nerode theorem for fuzzy languages
- An improved algorithm for determinization of weighted and fuzzy automata
- Approximation and robustness of fuzzy finite automata
- Associative functions. Triangular norms and copulas
- Brzozowski type determinization for fuzzy automata
- Canonization of max-min fuzzy automata
- Conditions for the existence of maximal factorizations
- Determinism and fuzzy automata
- Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
- Determinization of fuzzy automata via factorization of fuzzy states
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Determinization of weighted finite automata over strong bimonoids
- Formal power series and regular operations on fuzzy languages
- Further improvements of determinization methods for fuzzy finite automata
- Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Fuzzy languages
- Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure
- scientific article; zbMATH DE number 5141500 (Why is no real title available?)
- scientific article; zbMATH DE number 1183717 (Why is no real title available?)
- Myhill-Nerode type theory for fuzzy languages and automata
This page was built for publication: Finite determinization of fuzzy automata using a parametric product-based t-norm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932582)
