Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application

DOI10.2298/FIL1909809SzbMath1499.15119OpenAlexW3008545762MaRDI QIDQ5863634

Stefan Stanimirović, Aleksandar Stamenković, Miroslav Ćirić

Publication date: 3 June 2022

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1909809s

zbMATH Keywords

Boolean matricesweighted automatapartition refinementdeterminizationadditively idempotent semiringsmatrices over semirings

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Boolean and Hadamard matrices (15B34)

Related Items

Approximate positional analysis of fuzzy social networks, Computation of solutions to certain nonlinear systems of fuzzy relation inequations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fuzzy relational inequalities and equations, fuzzy quasi-orders, closures and openings of fuzzy sets
• Bisimulations for fuzzy automata
• An improved algorithm for determinization of weighted and fuzzy automata
• On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
• Logical characterizations of simulation and bisimulation for fuzzy transition systems
• Further improvements of determinization methods for fuzzy finite automata
• Computation of the greatest simulations and bisimulations between fuzzy automata
• NFA reduction algorithms by means of regular inequalities
• Reduction of fuzzy automata by means of fuzzy quasi-orders
• Handbook of weighted automata
• Nondeterministic automata: equivalence, bisimulations, and uniform relations
• CCS expressions, finite state processes, and three problems of equivalence
• Fuzzy relation equations and reduction of fuzzy automata
• Determinization of weighted finite automata over strong bimonoids
• A calculus of communicating systems
• Reducing NFAs by invariant equivalences.
• Finite nondeterministic automata: simulation and minimality
• Weakly linear systems of fuzzy relation inequalities: the heterogeneous case
• Mergible states in large NFA
• Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences
• An efficient algorithm for computing bisimulation equivalence
• Deciding bisimilarity and similarity for probabilistic processes.
• Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
• Bisimulations for weighted automata over an additively idempotent semiring
• Bisimulation relations for weighted automata
• Weakly linear systems of fuzzy relation inequalities and their applications: A brief survey
• Three Partition Refinement Algorithms
• The algorithmics of bisimilarity
• Factorization of Fuzzy Automata
• Combinatorial Pattern Matching
• Theory Is Forever