| ADS |
General purpose facade for computing adaptive distinguishing sequences.
|
| ADSUtil |
Utility class, that offers some operations revolving around adaptive distinguishing sequences.
|
| BacktrackingSearch |
A class containing methods for computing adaptive distinguishing sequences (for arbitrary sets of states) by means of
a backtracking approach.
|
| LeeYannakakis |
Algorithm of Lee and Yannakakis for computing adaptive distinguishing sequences (of length at most n^2) in O(n^2)
time (where n denotes the number of states of the automaton).
|
| LYResult<S,I,O> |
Utility class that holds some information aggregated during the ADS computation of LeeYannakakis. |
| StateEquivalence |
A utility class for computing an adaptive distinguishing sequence by means of solving the state equivalence problems,
i.e. computing and ADS for two states only.
|