Three partition refinement algorithms
SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Forward and backward simulations I.: untimed systems
Information and Computation
Handbook of formal languages, vol. 1
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
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
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Automata and Computability
Words, Semigroups, and Transductions
Words, Semigroups, and Transductions
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithms for Computing Small NFAs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
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
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
Theoretical Computer Science - Insightful theory
Derivatives of rational expressions with multiplicity
Theoretical Computer Science
Determinization of fuzzy automata with membership values in complete residuated lattices
Information Sciences: an International Journal
Reactive Systems: Modelling, Specification and Verification
Reactive Systems: Modelling, Specification and Verification
Bisimulation relations for weighted automata
Theoretical Computer Science
Generalizing the Paige--Tarjan algorithm by abstract interpretation
Information and Computation
The Algorithm Design Manual
Uniform fuzzy relations and fuzzy functions
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
Backward and forward bisimulation minimization of tree automata
Theoretical Computer Science
Elements of Automata Theory
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
Backward and forward bisimulation minimisation of tree automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
An incremental bisimulation algorithm
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
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
An improved algorithm for determinization of weighted and fuzzy automata
Information Sciences: an International Journal
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
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
Computation of the greatest simulations and bisimulations between fuzzy automata
Fuzzy Sets and Systems
Factorization of fuzzy automata
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Hi-index | 0.07 |
In this paper we study the equivalence of nondeterministic automata pairing the concept of a bisimulation with the recently introduced concept of a uniform relation. In this symbiosis, uniform relations serve as equivalence relations which relate states of two possibly different nondeterministic automata, and bisimulations ensure compatibility with the transitions, initial and terminal states of these automata. We define six types of bisimulations, but due to the duality we discuss three of them: forward, backward-forward, and weak forward bisimulations. For each of these three types of bisimulations we provide a procedure which decides whether there is a bisimulation of this type between two automata, and when it exists, the same procedure computes the greatest one. We also show that there is a uniform forward bisimulation between two automata if and only if the factor automata with respect to the greatest forward bisimulation equivalences on these automata are isomorphic. We prove a similar theorem for weak forward bisimulations, using the concept of a weak forward isomorphism instead of an isomorphism. We also give examples that explain the relationships between the considered types of bisimulations.