1·Given this automaton, a receiver can reconstruct an entire XML document by transmitting very little information.
有了这种自动机，接收方可以通过传输少量信息，重建整个XML文档。
2·Yet for increased efficiency, it is best to work with deterministic finite automaton.
但是为了提高效率，最好使用确定性有限自动机。
3·Note that although the automaton is one-dimensional, you show sequential steps of its evolution in successive rows going down the page.
注意尽管自动机是一维的，但是用一组连续的行从上到下显示它的进化。
4·Then, given an XML document, it checks whether the XML is accepted by the automaton.
然后，给出一个XML文档，用它检查XML是否被自动机接受。
5·Such a table is used to implement nondeterministic finite automaton (NFA).
这样的表用来实现非确定性有限自动机(NFA)。