English Permutation automaton Cited by user Hermel on 15 Jul 2012 In automata theory, a permutation automaton, or pure-group automaton, is a deterministic finite automaton such that each input symbol permutes the set of states.