1·For example, the XAUST XML compressor converts the schema information of the DTD into a set of deterministic finite automata (DFA), one for each element in the DTD.
例如，XAUST XML压缩器将DTD的模式信息转换成一组确定性有限自动机(DFA)，每个DFA对应于DTD中的一个元素。
2·GRAFCET is a programming language dedicated to industrial automata (Arzul gives details in his post).
GRAFCET是工业自动机的专用编程语言(Arzul在他的帖子中给出了细节)。
3·Figure 6 shows the iteration of the Cellular Automata Forest Fire Model, skipping appropriately to show the effect of the rule set.
图6显示了这个元胞自动机森林火灾模型的迭代，跳跃恰当，很好地显示了所设规则的效果。
4·In language theory, the simplest algorithms are those which can be implemented by finite automata, the subject of this algorithm implement simplest book.
在语言理论，最简单的一类算法就是可以用有限自动机实理论可以算法现的算法，也是本书的主题。
5·The feature of this approach is that automata , used for developing, are.
这种方法的特点是自动机，开发利用，是。