Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences
From MaRDI portal
Publication:1794961
DOI10.1016/j.fss.2017.09.004zbMath1397.68118OpenAlexW2756038926MaRDI QIDQ1794961
Stefan Stanimirović, Zorana Jančić, Ivana Micić
Publication date: 16 October 2018
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2017.09.004
Formal languages and automata (68Q45) Theory of fuzzy sets, etc. (03E72) Generalizations of ordered sets (06A75)
Related Items
Approximate positional analysis of fuzzy social networks, Characterization and computation of approximate bisimulations for fuzzy automata, Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them, On the solvability of weakly linear systems of fuzzy relation equations, Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders, Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fuzzy relational inequalities and equations, fuzzy quasi-orders, closures and openings of fuzzy sets
- Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure
- Weak bisimulations for fuzzy automata
- Bisimulations for fuzzy automata
- Determinization of fuzzy automata via factorization of fuzzy states
- On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- Further improvements of determinization methods for fuzzy finite automata
- Computation of the greatest simulations and bisimulations between fuzzy automata
- NFA reduction algorithms by means of regular inequalities
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- Fuzzy preorder and fuzzy topology
- CCS expressions, finite state processes, and three problems of equivalence
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
- Fuzzy relation equations and reduction of fuzzy automata
- On the structure of F-indistinguishability operators
- Fuzzy equivalence relations
- Fuzzy sets and systems. Theory and applications
- A calculus of communicating systems
- Structure of transitive valued binary relations
- Connecting fuzzy preorders, fuzzy consequence operators and fuzzy closure and co-closure systems
- Reducing NFAs by invariant equivalences.
- From bisimulation to simulation: Coarsest partition problems
- Towards a unified view of bisimulation: A comparative study
- Finite nondeterministic automata: simulation and minimality
- Weakly linear systems of fuzzy relation inequalities: the heterogeneous case
- Mergible states in large NFA
- Topological properties of the class of generators of an indistinguishability operator
- Determinism and fuzzy automata
- Fuzzy groups, fuzzy functions and fuzzy equivalence relations.
- An efficient algorithm for computing bisimulation equivalence
- Forward and backward simulations. I. Untimed Systems
- Similarity relations, fuzzy partitions, and fuzzy orderings
- Fuzzy equivalence relations and their equivalence classes
- Similarity relations and fuzzy orderings
- Weakly linear systems of fuzzy relation inequalities and their applications: A brief survey
- Three Partition Refinement Algorithms
- Openings and closures of fuzzy preorderings: theoretical basics and applications to fuzzy rule-based systems
- Factorization of Fuzzy Automata
- Fuzzy sets
- Combinatorial Pattern Matching
- Theory Is Forever
- Fuzzy equational logic
