Reduction of fuzzy automata by means of fuzzy quasi-orders

DOI10.1016/j.ins.2014.02.028zbMath1341.68111arXiv1102.5451OpenAlexW2144156859MaRDI QIDQ726556

Miroslav Ćirić, Jelena Ignjatović, Aleksandar Stamenković

Publication date: 11 July 2016

Published in: Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

fuzzy automatonstate reductionfuzzy relation equationafterset automatonfuzzy discrete event systemfuzzy quasi-order

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (26)

Fuzzy relational inequalities and equations, fuzzy quasi-orders, closures and openings of fuzzy sets ⋮ Brzozowski type determinization for fuzzy automata ⋮ Weakly linear systems for matrices over the max-plus quantale ⋮ Fuzzy approximations of fuzzy relational structures ⋮ Fuzzy relation equations and inequalities with two unknowns and their applications ⋮ Characterization and computation of approximate bisimulations for fuzzy automata ⋮ On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations ⋮ Ranks of fuzzy matrices. Applications in state reduction of fuzzy automata ⋮ Bisimulations for fuzzy automata ⋮ Nondeterministic automata: equivalence, bisimulations, and uniform relations ⋮ 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 ⋮ Approximate State Reduction of Fuzzy Finite Automata ⋮ Weighted Automata over Vector Spaces ⋮ Algebraic and topological structures on factorizations of fuzzy sets1 ⋮ Further improvements of determinization methods for fuzzy finite automata ⋮ Labeled fuzzy approximations based on bisimulations ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata ⋮ Construction of fuzzy automata from fuzzy regular expressions ⋮ Weakly linear systems of fuzzy relation inequalities: the heterogeneous case ⋮ Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences ⋮ Direct and Indirect Methods for Solving Two-Mode Systems of Fuzzy Relation Equations and Inequalities ⋮ TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS ⋮ Moore-Penrose equations in involutive residuated semigroups and involutive quantales ⋮ Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application ⋮ Categories of fuzzy preorders, approximation operators and Alexandrov topologies1

Uses Software

• UMDES

Cites Work

• 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
• Decentralized supervisory control of fuzzy discrete event systems
• NFA reduction algorithms by means of regular inequalities
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
• Congruences and homomorphisms of fuzzy automata
• 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
• A compendium of fuzzy weak orders: representations and constructions
• CCS expressions, finite state processes, and three problems of equivalence
• Generalizing the Paige-Tarjan algorithm by abstract interpretation
• Is there a need for fuzzy logic?
• The relationship of controllability between classical and fuzzy discrete-event systems
• 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
• 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
• A calculus of communicating systems
• On quotient machines of a fuzzy automaton and the minimal machine
• Representations and constructions of similarity-based fuzzy orderings.
• Follow automata.
• Characterizations of fuzzy finite automata.
• Finite \(L\)-fuzzy machines.
• Minimization algorithm of fuzzy finite automata.
• Reducing NFAs by invariant equivalences.
• Fuzzy modifiers based on fuzzy relations.
• From bisimulation to simulation: Coarsest partition problems
• Towards a unified view of bisimulation: A comparative study
• Finite nondeterministic automata: simulation and minimality
• Mergible states in large NFA
• Minimization of fuzzy finite automata
• An efficient algorithm for computing bisimulation equivalence
• Fuzzy function as an approximate solution to a system of fuzzy relation equations
• A formal study of linearity axioms for fuzzy orderings
• Forward and backward simulations. I. Untimed Systems
• System of fuzzy relation equations as a continuous model of IF-THEN rules
• Fuzzy equivalence relations and their equivalence classes
• Equivalence in automata theory based on complete residuated lattice-valued logic
• Modeling and control of discrete-event dynamic systems with Petri nets and other tools.
• Determinization of fuzzy automata with membership values in complete residuated lattices
• Diagnosability of fuzzy discrete event systems
• Toward a generalized theory of uncertainty (GTU) -- an outline
• Introduction to Discrete Event Systems
• A SIMILARITY-BASED GENERALIZATION OF FUZZY ORDERINGS PRESERVING THE CLASSICAL AXIOMS
• Three Partition Refinement Algorithms
• Resolution of composite fuzzy relation equations
• Minimal NFA Problems are Hard
• Solvability and approximate solvability of fuzzy relation equations*
• Automated Technology for Verification and Analysis
• Factorization of Fuzzy Automata
• On the State Minimization of Nondeterministic Finite Automata
• Combinatorial Pattern Matching
• Fuzzy equational logic
• The cutting of compositions

This page was built for publication: Reduction of fuzzy automata by means of fuzzy quasi-orders