Bisimulations for fuzzy automata

DOI10.1016/j.fss.2011.07.003zbMath1237.68113arXiv1102.5452OpenAlexW2097074325MaRDI QIDQ423147

Milan Bašić, Miroslav Ćirić, Jelena Ignjatović, Nada Damljanović

Publication date: 18 May 2012

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.5452

zbMATH Keywords

simulationfuzzy automatabisimulationfuzzy relationscomplete residuated latticesfuzzy relation inequalitiesequivalence of automatafuzzy equivalence relationsstate reductionuniform fuzzy relations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Coalgebras for fuzzy transition systems, The universal fuzzy automaton, Weak bisimulations for fuzzy automata, Weakly linear systems for matrices over the max-plus quantale, Similarity-based minimization of fuzzy tree automata, Fuzzy approximations of fuzzy relational structures, Bisimulations for fuzzy transition systems revisited, Unnamed Item, Inherent Vacuity in Lattice Automata, Logical characterizations of fuzzy bisimulations in fuzzy modal logics over residuated lattices, Characterization and computation of approximate bisimulations for fuzzy automata, Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them, Fuzzy simulations and bisimulations between fuzzy automata, Fuzzy Bisimulations in Fuzzy Description Logics Under the Gödel Semantics, Distribution-based limited fuzzy bisimulations for nondeterministic fuzzy transition systems, Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems, Nondeterministic automata: equivalence, bisimulations, and uniform relations, Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders, Weighted Automata over Vector Spaces, A fuzzy modal logic for fuzzy transition systems, Bisimulations for weighted automata over an additively idempotent semiring, Bisimulation and bisimilarity for fuzzy description logics under the Gödel semantics, Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures, Algebraic and topological structures on factorizations of fuzzy sets1, Lattice-valued simulations for quantitative transition systems, Limited approximate bisimulations and the corresponding rough approximations, Characterizing fuzzy simulations for fuzzy labeled transition systems in fuzzy propositional dynamic logic, Logical characterizations of simulation and bisimulation for fuzzy transition systems, Further improvements of determinization methods for fuzzy finite automata, Nondeterministic fuzzy automata with membership values in complete residuated lattices, Labeled fuzzy approximations based on bisimulations, Polynomial-time algorithms for computing distances of fuzzy transition systems, Computation of the greatest simulations and bisimulations between fuzzy automata, Model checking fuzzy computation tree logic, Construction of fuzzy automata from fuzzy regular expressions, Weakly linear systems of fuzzy relation inequalities: the heterogeneous case, Quantitative simulations by matrices, Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences, Approximate bisimulation relations for fuzzy automata, Bisimulation of type 2 for BL-general fuzzy automata, Direct and Indirect Methods for Solving Two-Mode Systems of Fuzzy Relation Equations and Inequalities, (f, g)-derivation of ordered Γ-semirings, Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application, Regular fuzzy equivalences on two - mode fuzzy Networksi, Simulation for lattice-valued doubly labeled transition systems

Uses Software

• Stony Brook

Cites Work

• Fuzzy equational logic
• Generalized morphisms, a new tool for comparative evaluation of performance of fuzzy implications, t-norms and co-norms in relational knowledge elicitation
• Decompositions of \(T\)-generalized transformation semigroups.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved algorithm for determinization of weighted and fuzzy automata
• On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
• Finite automata theory with membership values in lattices
• NFA reduction algorithms by means of regular inequalities
• Reduction of fuzzy automata by means of fuzzy quasi-orders
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
• Congruences and homomorphisms of fuzzy automata
• Backward and forward bisimulation minimization of tree automata
• Weighted finite automata over strong bimonoids
• Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
• Minimization of states in automata theory based on finite lattice-ordered monoids
• Automata theory based on complete residuated lattice-valued logic
• Automata theory based on complete residuated lattice-valued logic. II
• CCS expressions, finite state processes, and three problems of equivalence
• Generalizing the Paige-Tarjan algorithm by abstract interpretation
• Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization
• 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
• Determinization of weighted finite automata over strong bimonoids
• 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
• What's decidable about hybrid automata?
• Products of \(T\)-generalized state machines and \(T\)-generalized transformation semigroups
• Products of fuzzy finite state machines
• Metamathematics of fuzzy logic
• On covering of products of fuzzy finite state machines
• On quotient machines of a fuzzy automaton and the minimal machine
• Characterizations of fuzzy finite automata.
• Finite \(L\)-fuzzy machines.
• Minimization algorithm of fuzzy finite automata.
• 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
• Derivatives of rational expressions with multiplicity
• A theory of vague lattices based on many-valued equivalence relations. I: General representation results
• Minimization of fuzzy finite automata
• Fuzzy functions and their applications
• Determinism and fuzzy automata
• An efficient algorithm for computing bisimulation equivalence
• Forward and backward simulations. I. Untimed Systems
• Formal power series and regular operations on fuzzy languages
• Fuzzy equivalence relations and their equivalence classes
• 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
• Determinization of fuzzy automata with membership values in complete residuated lattices
• Bisimulation relations for weighted automata
• The relationships among several types of fuzzy automata
• Algebraic properties of \(LA\)-languages
• Max-product machines
• Conjugacy and Equivalence of Weighted Automata and Functional Transducers
• On the generating sequences of regular languages on k symbols
• Backward and Forward Bisimulation Minimisation of Tree Automata
• Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices
• Three Partition Refinement Algorithms
• Equational axioms for regular sets
• ON THE GENERAL THEORY OF RELATIONALMORPHISMS
• Foundations of fuzzy functions and vague algebra based on many-valued equivalence relations, part I: fuzzy functions and their applications
• FINITE ${\mathbb L}$–FUZZY ACCEPTORS, REGULAR ${\mathbb L}$–FUZZY GRAMMARS AND SYNTACTIC PATTERN RECOGNITION
• A GENERALIZATION OF KOZEN'S AXIOMATIZATION OF THE EQUATIONAL THEORY OF THE REGULAR SETS
• Reactive Systems
• Factorization of Fuzzy Automata
• Lattice Automata
• Homomorphism and Isomorphism Theorems Generalized from a Relational Perspective
• On relational homomorphisms of automata
• Maximin automata
• A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
• Combinatorial Pattern Matching
• Automata, Languages and Programming
• Theory Is Forever