-
Three Simulation Algorithms for Labelled Transition Systems
Algorithms which compute the coarsest simulation preorder are generally designed on Kripke structures. Only in a second time they are extended to labelled transition... -
Bisimulations over DLTS in O(m.log n)-time
Submitted to DLT'13 -
The Hardness of Code Equivalence over $\mathbf{F}_q$ and its Application to C...
International audience -
P6- and triangle-free graphs revisited: structure and bounded clique-width
International audience
