Complete permutation Gray code implemented by finite state machine

An enumerating method of complete permutation array is proposed. The list of n! permutations based on Gray code defined over finite symbol set Zn = {1, 2, …, n} is implemented by finite state machine, named as n-RPGCF. An RPGCF can be used to search permutation code and provide improved lower bounds on the maximum cardinality of a permutation code in some cases.