We examine the accepting state complexity, i.e., the minimal number of accepting states of deterministic finite automata for languages resulting from unary and binary operations on languages with accepting state complexity given as a parameter. This is a continuation of the work of [J. Dassow: On the number of accepting states of finite automata, J. Autom., Lang. Comb., 21, 2016]. We solve most of the open problems mentioned thereof. In particular, we consider the operations of intersection, symmetric difference, right and left quotients, reversal, and permutation (on finite languages), where we obtain precise ranges of accepting state complexities. We also consider symmetric difference on unary finite languages where we obtain a non-contiguous range of accepting state complexities.

中文翻译：

---

接受某些操作导致的语言状态复杂性的范围

我们检查接受状态复杂度，即语言的确定性有限自动机的接受状态的最小数量，该语言由接受状态复杂度作为参数给出的语言的一元和二元运算产生。这是 [J. Dassow：关于有限自动机的接受状态数，J. Autom.，Lang。梳，2016 年 21 月]。我们解决了其中提到的大多数未解决的问题。特别是，我们考虑了交集、对称差、左右商、反转和排列（在有限语言上）的操作，在这些操作中，我们获得了接受状态复杂性的精确范围。我们还考虑了一元有限语言的对称差异，其中我们获得了一个不连续的接受状态复杂度范围。