论文标题
二进制完全可达的自动机
Binary completely reachable automata
论文作者
论文摘要
我们用两个输入字母来表征完整的确定性有限自动机，其中每一组非空的状态都作为在合适的输入词的动作下设置的整个状态的图像。表征导致多项式时间算法识别这类自动机。
We characterize complete deterministic finite automata with two input letters in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word. The characterization leads to a polynomial-time algorithm for recognizing this class of automata.
