Computer Science and Software Engineering
Study
For
About
The thesis combines (fuses) two algorithms to generate combinatorial objects in constant time per object. Two kinds of objects are generated.
One is the set of multiset permutations, and the other is the set of
mixed parenthesis strings.
For the first problem, Johnson-Trotter is used for permutations and Chase is used for combinations.
For the second problem, Xiang-Ushijima is used for parenthesis strings and the obvious binary Grey code is used for binary strings.