Weak bisimulations for fuzzy automata
From MaRDI portal
Publication:279375
DOI10.1016/j.fss.2013.10.006zbMath1334.68120OpenAlexW1989709510MaRDI QIDQ279375
Publication date: 28 April 2016
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2013.10.006
simulationfuzzy automatabisimulationcomplete residuated latticesfuzzy relation inequalitiesequivalence of automatafuzzy equivalence relationsstate reductionuniform fuzzy relationsweak bisimulations
Related Items
Similarity-based minimization of fuzzy tree automata, Characterization and computation of approximate bisimulations for fuzzy automata, Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them, Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders, Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures, Further improvements of determinization methods for fuzzy finite automata, Polynomial-time algorithms for computing distances of fuzzy transition systems, Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences, Approximate bisimulation relations for fuzzy automata
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Brzozowski type determinization for fuzzy automata
- Bisimulations for fuzzy automata
- An improved algorithm for determinization of weighted and fuzzy automata
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Automata theory based on complete residuated lattice-valued logic: Turing machines
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Backward and forward bisimulation minimization of tree automata
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
- Myhill-Nerode type theory for fuzzy languages and automata
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Fuzzy relation equations and reduction of fuzzy automata
- A note on Trillas' CHC models
- Uniform fuzzy relations and fuzzy functions
- Automata theory based on complete residuated lattice-valued logic: Pushdown automata
- Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic
- Fuzzy homomorphisms of algebras
- Automata theory based on complete residuated lattice-valued logic: a categorical approach
- Fuzzy sets and systems. Theory and applications
- A calculus of communicating systems
- Fuzzy automata and languages
- Characterizations of fuzzy finite automata.
- Finite \(L\)-fuzzy machines.
- Construction of fuzzy automata from fuzzy regular expressions
- Weakly linear systems of fuzzy relation inequalities: the heterogeneous case
- A theory of vague lattices based on many-valued equivalence relations. I: General representation results
- Fuzzy functions and their applications
- Forward and backward simulations. I. Untimed Systems
- Deciding bisimilarity and similarity for probabilistic processes.
- Formal power series and regular operations on fuzzy languages
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Bisimulation relations for weighted automata
- Max-product machines
- Weakly linear systems of fuzzy relation inequalities and their applications: A brief survey
- Backward and Forward Bisimulation Minimisation of Tree Automata
- Foundations of fuzzy functions and vague algebra based on many-valued equivalence relations, part I: fuzzy functions and their applications
- Factorization of Fuzzy Automata
- Maximin automata
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Fuzzy equational logic
