A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata

TL;DR

This paper characterizes the exact spectrum of accepting-state complexities for right quotients in permutation automata over arbitrary alphabets, extending known unary results and providing a complete solution to the larger-alphabet case.

Contribution

It proves the full spectrum of right-quotient accepting-state complexities for permutation automata over arbitrary alphabets, filling a key gap in automata theory.

Findings

For nonempty languages, all positive accepting-state complexities are attainable.

The spectrum over arbitrary alphabets is  if either language is empty.

A group-theoretic construction achieves any desired positive complexity .

Abstract

This paper resolves the open larger-alphabet quotient case in the accepting-state complexity theory of permutation automata. Rauch and Holzer showed that, in the unary setting, the attainable right-quotient accepting-state complexities are exactly $[1,mn]$. We prove that over arbitrary alphabets the exact spectrum is $g^{\operatorname{asc}}_{-1,\mathrm{PFA}}(m,n)=\{0\}$ if $m=0$ or $n=0$, and $g^{\operatorname{asc}}_{-1,\mathrm{PFA}}(m,n)=\mathbb{N}_{>0}$ if $m,n\ge 1$. Thus, once both input languages are nonempty, every positive accepting-state complexity is attainable for right quotient, and $0$ is the only unavoidable magic value. The proof has two parts. First, we show that if $m,n\ge 1$, then the quotient language $KL^{-1}$ cannot be empty when $K$ and $L$ are accepted by permutation automata with $\operatorname{asc}(K)=m$ and $\operatorname{asc}(L)=n$; this follows from the bijectivity of the transition action. Second, for every $m,n\ge 1$ and every $\alpha\ge m$, we construct a ternary witness pair $(A^{\mathrm{q}}_{m,\alpha},B^{\mathrm{q}}_{n,\alpha})$ such that $\operatorname{asc}(L(A^{\mathrm{q}}_{m,\alpha}))=m$, $\operatorname{asc}(L(B^{\mathrm{q}}_{n,\alpha}))=n$, and $\operatorname{asc}(L(A^{\mathrm{q}}_{m,\alpha})L(B^{\mathrm{q}}_{n,\alpha})^{-1})=\alpha$. The high-range construction is group-theoretic: the words accepted by $B^{\mathrm{q}}_{n,\alpha}$ induce exactly a point stabilizer in a symmetric group, and the standard quotient construction then saturates the original final set of $A^{\mathrm{q}}_{m,\alpha}$ to a full orbit, yielding a minimal quotient automaton with exactly $\alpha$ final states. Combined with the known unary interval $[1,mn]$, this yields the complete spectrum and resolves the larger-alphabet right-quotient case for permutation automata.