On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
DOI10.1016/j.fss.2010.08.002zbMath1231.03044OpenAlexW2130214363MaRDI QIDQ622073
Stojan Bogdanović, Jelena Ignjatović, Miroslav Ćirić
Publication date: 31 January 2011
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2010.08.002
fuzzy automatafuzzy relation equationscomplete residuated latticesfuzzy quasi-ordersfuzzy relation inequalitiessocial network analysisconcurrency theoryfuzzy equivalencesregular fuzzy relationsresiduals of fuzzy relations
Social networks; opinion dynamics (91D30) Formal languages and automata (68Q45) Theory of fuzzy sets, etc. (03E72) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Cites Work
- NFA reduction algorithms by means of regular inequalities
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- A survey on fuzzy relational equations. I: Classification and solvability
- 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
- Algorithm for solving max-product fuzzy relational equations
- 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
- Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization
- Myhill-Nerode type theory for fuzzy languages and automata
- On max-min linear inequalities and coalitional resource games with sharable resources
- 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
- Exponential behaviour of the Butkovič-Zimmermann algorithm for solving two-sided linear systems in max-algebra
- 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
- The solution sets of infinite fuzzy relational equations with sup-conjunctor composition on complete distributive lattices
- A calculus of communicating systems
- The analysis of semigroups of multirelational systems
- Resolution of eigen fuzzy sets equations
- What's decidable about hybrid automata?
- On quotient machines of a fuzzy automaton and the minimal machine
- 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
- Mergible states in large NFA
- Lattices and ordered algebraic structures
- Minimization of fuzzy finite automata
- The equation \(A \otimes x = B \otimes y\) over \((\max,+)\)
- An efficient algorithm for computing bisimulation equivalence
- Fuzzy function as an approximate solution to a system of fuzzy relation equations
- Forward and backward simulations. I. Untimed Systems
- Formal power series and regular operations on fuzzy languages
- Generalized fuzzy rough approximation operators based on fuzzy coverings
- System of fuzzy relation equations as a continuous model of IF-THEN rules
- Fuzzy equivalence relations and their equivalence classes
- Some properties of infinite fuzzy relational equations on complete Brouwerian lattices
- Equivalence in automata theory based on complete residuated lattice-valued logic
- A theoretical investigation of regular equivalences for fuzzy graphs
- Network analysis. Methodological foundations.
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Bisimulation relations for weighted automata
- A strongly polynomial algorithm for solving two-sided linear systems in max-algebra
- L-fuzzy sets
- Backward and Forward Bisimulation Minimisation of Tree Automata
- Three Partition Refinement Algorithms
- Resolution of composite fuzzy relation equations
- Solvability and approximate solvability of fuzzy relation equations*
- FINITE ${\mathbb L}$–FUZZY ACCEPTORS, REGULAR ${\mathbb L}$–FUZZY GRAMMARS AND SYNTACTIC PATTERN RECOGNITION
- Regular equivalence: General theory
- Factorization of Fuzzy Automata
- Network Analysis
- 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