Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings

@article{Proskurowski1998AnalysisOA,
title={Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings},
author={Andrzej Proskurowski and Frank Ruskey and Malcolm A Smith},
journal={SIAM J. Discrete Math.},
year={1998},
volume={11},
pages={94-109}
}

We give eecient algorithms for listing equivalence classes of k-ary strings under reversal and permutation of alphabet symbols. As representative of each equivalence class we choose that string which is lexicographically smallest. These algorithms use space O(n) and time O(p kN), where N is the total number of strings generated and n is the length of each string. For k = 2, we obtain a recursive decomposition of the set of binary strings that allows the strings to be generated without rejectingâ€¦Â CONTINUE READING