8 citations · 9 across the 3 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2013
Bisimulations over DLTS in O(m.log n)-time
Gérard Cece
The well known Hopcroft's algorithm to minimize deterministic complete automata runs in -time, where is the size of the alphabet and the number of states. The…
cs.FL2013★ 8 cited
Three Simulation Algorithms for Labelled Transition Systems
Gérard Cécé
Algorithms which compute the coarsest simulation preorder are generally designed on Kripke structures. Only in a second time they are extended to labelled transition systems. By do…