Polynomial crisp-minimization algorithm for fuzzy deterministic automata
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1183717 (Why is no real title available?)
- scientific article; zbMATH DE number 1862743 (Why is no real title available?)
- scientific article; zbMATH DE number 3189697 (Why is no real title available?)
- A generalization of Myhill-Nerode theorem for fuzzy languages
- A polynomial double reversal minimization algorithm for deterministic finite automata
- Approximate State Reduction of Fuzzy Finite Automata
- Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Bisimulations for fuzzy automata
- Brzozowski type determinization for fuzzy automata
- Canonization of max-min fuzzy automata
- Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences
- 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
- 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 with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure
- Fuzzy relation equations and reduction of fuzzy automata
- Minimization of lattice finite automata and its application to the decomposition of lattice languages
- Minimizing deterministic lattice automata
- Myhill-Nerode type theory for fuzzy languages and automata
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- Theory of átomata
- Theory of átomata
This page was built for publication: Polynomial crisp-minimization algorithm for fuzzy deterministic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932526)
