Pages that link to "Item:Q924726"
From MaRDI portal
The following pages link to Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726):
Displaying 18 items.
- Bisimulations for fuzzy automata (Q423147) (← links)
- An abstract interpretation framework for genotype elimination algorithms (Q428908) (← links)
- On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations (Q622073) (← links)
- Computation of the greatest simulations and bisimulations between fuzzy automata (Q690916) (← links)
- Reduction of fuzzy automata by means of fuzzy quasi-orders (Q726556) (← links)
- Nondeterministic automata: equivalence, bisimulations, and uniform relations (Q903611) (← links)
- Fuzzy relation equations and reduction of fuzzy automata (Q988575) (← links)
- Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences (Q1794961) (← links)
- From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
- Team equivalences for finite-state machines with silent moves (Q2216117) (← links)
- A generalization of Takane's algorithm for DEDICOM (Q2638682) (← links)
- Computing Stuttering Simulations (Q3184698) (← links)
- Efficient Coalgebraic Partition Refinement (Q5111646) (← links)
- Causal Semantics for BPP Nets with Silent Moves (Q5164874) (← links)
- (Q5214815) (← links)
- An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation (Q5278211) (← links)
- (Q5856411) (← links)
- Generic partition refinement and weighted tree automata (Q6535955) (← links)