逻辑上,每个规则表达式都等价于一个状态机,而每个规则表达式的语法分析器都实现这个状态机。
Every regular expression is logically equivalent to a state machine, and the parser of every regular expression implements a state machine.
转换表中的状态所实现的功能等价于SAXCountHandler中stack。
The states in the transition table implement the equivalent of the stack in SAXCountHandler.
该文论述了拓扑空间(组)的同伦等价变换在有序介质状态和缺陷的拓扑分类中的应用问题。
In this paper the application of homotopy equivalence transformation of topological space sets to the topological classification of states and defects in ordered media is discussed.
应用推荐