Three partition refinement algorithms
SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Fuzzy sets and fuzzy logic: theory and applications
Fuzzy sets and fuzzy logic: theory and applications
Forward and backward simulations I.: untimed systems
Information and Computation
Handbook of formal languages, vol. 1
Products of fuzzy finite state machines
Fuzzy Sets and Systems
Products of T-generalized state machines and T-generalized transformation semigroups
Fuzzy Sets and Systems
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Minimization of fuzzy finite automata
Information Sciences: an International Journal
Towards a unified view of bisimulation: a comparative study
Theoretical Computer Science
Finite nondeterministic automata: simulation and minimality
Theoretical Computer Science
Fuzzy points, fuzzy relations and fuzzy functions
Discovering the world with fuzzy logic
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Automata and Computability
On covering of products of fuzzy finite state machines
Fuzzy Sets and Systems
On quotient machines of a fuzzy automaton and the minimal machine
Fuzzy Sets and Systems
Algorithms for Computing Small NFAs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Categories of relational structures
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
On the Construction of Reversible Automata for Reversible Languages
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Automata and Coinduction (An Exercise in Coalgebra)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Determinism and fuzzy automata
Information Sciences—Informatics and Computer Science: An International Journal
Toward an Algebraic Theory of Fuzzy Relational Systems
Toward an Algebraic Theory of Fuzzy Relational Systems
On generalizations of adaptive algorithms and application of the fuzzy sets concept to pattern classification
Reducing NFAs by invariant equivalences
Theoretical Computer Science
From Bisimulation to Simulation: Coarsest Partition Problems
Journal of Automated Reasoning
On the generating sequences of regular languages on k symbols
Journal of the ACM (JACM)
An efficient algorithm for computing bisimulation equivalence
Theoretical Computer Science
NFA reduction algorithms by means of regular inequalities
Theoretical Computer Science - Developments in language theory
Derivatives of rational expressions with multiplicity
Theoretical Computer Science
Minimization of states in automata theory based on finite lattice-ordered monoids
Information Sciences: an International Journal
Artificial Intelligence
Fuzzy equivalence relations and their equivalence classes
Fuzzy Sets and Systems
Equivalence in automata theory based on complete residuated lattice-valued logic
Fuzzy Sets and Systems
Determinization of fuzzy automata with membership values in complete residuated lattices
Information Sciences: an International Journal
Bisimulation relations for weighted automata
Theoretical Computer Science
Generalizing the Paige--Tarjan algorithm by abstract interpretation
Information and Computation
Fuzzification of Rational and Recognizable Sets
Fundamenta Informaticae
Information Sciences: an International Journal
Uniform fuzzy relations and fuzzy functions
Fuzzy Sets and Systems
Automata theory based on complete residuated lattice-valued logic: Pushdown automata
Fuzzy Sets and Systems
On the origins of bisimulation and coinduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fuzzy homomorphisms of algebras
Fuzzy Sets and Systems
Automata theory based on complete residuated lattice-valued logic: A categorical approach
Fuzzy Sets and Systems
Backward and forward bisimulation minimization of tree automata
Theoretical Computer Science
Elements of Automata Theory
Weighted finite automata over strong bimonoids
Information Sciences: an International Journal
Fuzzy discrete-event systems under fuzzy observability and a test algorithm
IEEE Transactions on Fuzzy Systems
Congruences and homomorphisms of fuzzy automata
Fuzzy Sets and Systems
Information Sciences: an International Journal
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Backward and forward bisimulation minimisation of tree automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Fuzzy relation equations and reduction of fuzzy automata
Journal of Computer and System Sciences
Determinization of weighted finite automata over strong bimonoids
Information Sciences: an International Journal
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Finite automata theory with membership values in lattices
Information Sciences: an International Journal
An improved algorithm for determinization of weighted and fuzzy automata
Information Sciences: an International Journal
Conjugacy and equivalence of weighted automata and functional transducers
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
On the equivalence of Z-automata
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Reducing the size of NFAs by using equivalences and preorders
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Homomorphism and isomorphism theorems generalized from a relational perspective
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Algebraic properties of LA-languages
Information Sciences: an International Journal
The relationships among several types of fuzzy automata
Information Sciences: an International Journal
Modeling and control of fuzzy discrete event systems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Supervisory control of fuzzy discrete event systems: a formal approach
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Factorization of fuzzy automata
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Construction of fuzzy automata from fuzzy regular expressions
Fuzzy Sets and Systems
Weakly linear systems of fuzzy relation inequalities: The heterogeneous case
Fuzzy Sets and Systems
Computation of the greatest simulations and bisimulations between fuzzy automata
Fuzzy Sets and Systems
Fuzzy relation equations and subsystems of fuzzy transition systems
Knowledge-Based Systems
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
Information Sciences: an International Journal
Coalgebras for Fuzzy Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Simulation for lattice-valued doubly labeled transition systems
International Journal of Approximate Reasoning
Hi-index | 0.20 |
Bisimulations have been widely used in many areas of computer science to model equivalence between various systems, and to reduce the number of states of these systems, whereas uniform fuzzy relations have recently been introduced as a means to model the fuzzy equivalence between elements of two possible different sets. Here we use the conjunction of these two concepts as a powerful tool in the study of equivalence between fuzzy automata. We prove that a uniform fuzzy relation between fuzzy automata A and B is a forward bisimulation if and only if its kernel and co-kernel are forward bisimulation fuzzy equivalence relations on A and B and there is a special isomorphism between factor fuzzy automata with respect to these fuzzy equivalence relations. As a consequence we get that fuzzy automata A and B are UFB-equivalent, i.e., there is a uniform forward bisimulation between them, if and only if there is a special isomorphism between the factor fuzzy automata of A and B with respect to their greatest forward bisimulation fuzzy equivalence relations. This result reduces the problem of testing UFB-equivalence to the problem of testing isomorphism of fuzzy automata, which is closely related to the well-known graph isomorphism problem. We prove some similar results for backward-forward bisimulations, and we point to fundamental differences. Because of the duality with the studied concepts, backward and forward-backward bisimulations are not considered separately. Finally, we give a comprehensive overview of various concepts on deterministic, nondeterministic, fuzzy, and weighted automata, which are related to bisimulations.