Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization
From MaRDI portal
Publication:955726
DOI10.1016/j.ins.2008.07.009zbMath1170.68506OpenAlexW2004660730MaRDI QIDQ955726
Publication date: 20 November 2008
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2008.07.009
Related Items
Unnamed Item, On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations, Bisimulations for fuzzy automata, Resolution of fuzzy relational equations -- method, algorithm and software with applications, Algebraic properties of \(L\)-fuzzy finite automata, Minimal realization for fuzzy behaviour: A bicategory-theoretic approach, DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA, Further improvements of determinization methods for fuzzy finite automata, Linear optimization with mixed fuzzy relation inequality constraints using the pseudo-t-norms and its application, Computation of the greatest simulations and bisimulations between fuzzy automata, Construction of fuzzy automata from fuzzy regular expressions, High-order methods for parabolic problems, Automata theory based on complete residuated lattice-valued logic: Reduction and minimization, Weighted finite automata with output
Cites Work
- Relation equations in residuated lattices
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Minimization of states in automata theory based on finite lattice-ordered monoids
- Algebraic analysis of fuzzy systems
- Algorithm for solving max-product fuzzy relational equations
- Behaviour, reduction and minimization of finite \({\mathbb{L}}\)-automata
- Equivalence, reduction and minimization of finite automata over semirings
- Metamathematics of fuzzy logic
- Finite \(L\)-fuzzy machines.
- Minimization algorithm of fuzzy finite automata.
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Minimization of lattice finite automata and its application to the decomposition of lattice languages
- Infinite fuzzy computations
- A categorical approach to lattice-valued fuzzy automata
- The relationships among several types of fuzzy automata
- Maximin, Minimax, and composite sequential machines
- Max-product machines
- On reductions of maximin machines
- A formal power series approach to the construction of minimal fuzzy automata
- Homomorphisms of fuzzy recognizers
- Resolution of composite fuzzy relation equations
- General formulation of sequential machines
- Maximin automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
