  We investigate the accepting state complexity of deterministic finite
automata for regular languages obtained by applying one of the following
operations to languages accepted by permutation automata: union, quotient,
complement, difference, intersection, Kleene star, Kleene plus, and reversal.
The paper thus joins the study of accepting state complexity of regularity
preserving language operations which was initiated by the work [J. Dassow: On
the number of accepting states of finite automata, J. Autom., Lang. Comb., 21,
2016]. We show that for almost all of the operations, except for reversal and
quotient, there is no difference in the accepting state complexity for
permutation automata compared to deterministic finite automata in general. For
both reversal and quotient we prove that certain accepting state complexities
cannot be obtained; these number are called "magic" in the literature.
Moreover, we solve the left open accepting state complexity problem for the
intersection of unary languages accepted by permutation automata and
deterministic finite automata in general.
