For permutation automata over non-unary alphabets, the accepting-state complexity of the right quotient is any positive integer when both input languages are nonempty.
On the Number of Accepting States of Finite Automata
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata
For permutation automata over non-unary alphabets, the accepting-state complexity of the right quotient is any positive integer when both input languages are nonempty.