Fuzzy relation equations and reduction of fuzzy automata
From MaRDI portal
Publication:988575
DOI10.1016/j.jcss.2009.10.015zbMath1197.68051OpenAlexW2083896909MaRDI QIDQ988575
Aleksandar Stamenković, Tatjana Petković, Jelena Ignjatović, Miroslav Ćirić
Publication date: 18 August 2010
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2009.10.015
fuzzy automatonfuzzy equivalencestate reductionfuzzy relation equationcomplete residuated latticealternate reductionfactor fuzzy automatonright invariant fuzzy equivalence
Related Items
The universal fuzzy automaton, Weak bisimulations for fuzzy automata, 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, Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them, 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, Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures, Further improvements of determinization methods for fuzzy finite automata, Nondeterministic fuzzy automata with membership values in complete residuated lattices, 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, Myhill-Nerode type theory for fuzzy languages and automata, Reduction of fuzzy automata by means of fuzzy quasi-orders, Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences, Approximate bisimulation relations for fuzzy automata, 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, Regular fuzzy equivalences on two - mode fuzzy Networksi
Cites Work
- 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
- Backward and forward bisimulation minimization of tree 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
- CCS expressions, finite state processes, and three problems of equivalence
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
- 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
- Automata theory based on complete residuated lattice-valued logic: a categorical approach
- On the structure of F-indistinguishability operators
- A calculus of communicating systems
- Equality relations as a basis for fuzzy control
- On quotient machines of a fuzzy automaton and the minimal machine
- Follow automata.
- 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
- Mergible states in large NFA
- Minimization of fuzzy finite automata
- Topological properties of the class of generators of an indistinguishability operator
- Fuzzy groups, fuzzy functions and fuzzy equivalence relations.
- An efficient algorithm for computing bisimulation equivalence
- Forward and backward simulations. I. Untimed Systems
- Fuzzy equivalence relations and their equivalence classes
- 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
- Backward and Forward Bisimulation Minimisation of Tree Automata
- Three Partition Refinement Algorithms
- Minimal NFA Problems are Hard
- Factorization of Fuzzy Automata
- On the State Minimization of Nondeterministic Finite Automata
- Combinatorial Pattern Matching
- Theory Is Forever
- Fuzzy equational logic
- 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
