We prove PSPACE-completeness of checking whether a given ideal language serves as the language of reset words for some automaton with at most four states over a binary alphabet. We compare the reset complexity and the state complexity for languages related to slowly synchronizing automata.

中文翻译：

---

通过二进制字母重置理想语言的复杂性

我们证明了检查给定理想语言是否用作在二进制字母表上最多具有四个状态的某些自动机的重置词的语言的 PSPACE 完备性。我们比较了与慢速同步自动机相关的语言的重置复杂度和状态复杂度。