An improved algorithm for determinization of weighted and fuzzy automata
From MaRDI portal
Publication:543822
DOI10.1016/j.ins.2010.12.008zbMath1216.68144OpenAlexW2102963979MaRDI QIDQ543822
Miroslav Ćirić, Jelena Ignjatović, Zorana Jančić
Publication date: 17 June 2011
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2010.12.008
Related Items (16)
Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure ⋮ Weak bisimulations for fuzzy automata ⋮ Brzozowski type determinization for fuzzy automata ⋮ Bisimulations for fuzzy automata ⋮ Nondeterministic automata: equivalence, bisimulations, and uniform relations ⋮ A new algorithm for testing diagnosability of fuzzy discrete event systems ⋮ Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders ⋮ Weighted Automata over Vector Spaces ⋮ Determinization of fuzzy automata via factorization of fuzzy states ⋮ Further improvements of determinization methods for fuzzy finite automata ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata ⋮ Construction of fuzzy automata from fuzzy regular expressions ⋮ Nondeterministic fuzzy automata ⋮ The relationships among several forms of weighted finite automata over strong bimonoids ⋮ Canonization of max-min fuzzy automata ⋮ Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automata theory based on quantum logic: Some characterizations
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- On the recognizability of fuzzy languages. II
- Handbook of weighted automata
- Weighted finite automata over strong bimonoids
- On the recognizability of fuzzy languages. I
- Myhill-Nerode type theory for fuzzy languages and automata
- Determinization of weighted finite automata over strong bimonoids
- Minimization algorithms for sequential transducers
- Automata theory based on quantum logic. I
- Determinism and fuzzy automata
- Formal power series and regular operations on fuzzy languages
- Fuzzy tree language recognizability
- Automata theory based on quantum logic: reversibilities and pushdown automata
- Determinization of fuzzy automata with membership values in complete residuated lattices
- A theory of computation based on quantum logic. I
- On the Determinization of Weighted Finite Automata
- Alternating Weighted Automata
- Introduction to Discrete Event Systems
- Quantitative Languages
- Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices
- Five Determinisation Algorithms
- Finite automata based on quantum logic and monadic second-order quantum logic
- Weighted Automata Algorithms
- Fuzzy Languages
- Formal Models of Communicating Systems
- Automata Theory with Modern Applications
- Automata theory based on quantum logic. II.
This page was built for publication: An improved algorithm for determinization of weighted and fuzzy automata
