论文标题
完全可达的自动机：自动机，图和树之间的相互作用
Completely reachable automata: an interplay between automata, graphs, and trees
论文作者
论文摘要
确定性有限的自动机，其中每一组非空的状态都作为在合适的输入词的动作下的整个状态的图像中发生的，称为完全可以触及。我们用图和树来表征这种自动机。
A deterministic finite automaton 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 is called completely reachable. We characterize such automata in terms of graphs and trees.
