对于为屏幕流编写文档，我们也希望使用状态转换图。
For documenting a screen flow, we also like to use state transition diagrams.
图1显示了对此生命周期建模的简化状态转换图。
Figure 1 shows this lifecycle modeled as a simplified state transition diagram.
提出一种基于状态转换图的时序电路等价验证算法。
A sequential equivalence checking algorithm based on state transfer graph is presented.
其次，前面的 Order 的状态转换图可清楚说明订单的有状态行为。
Next, remember how the state transition diagram for the Order clarified stateful behavior of the order.
用正规文法和正规表达式描述了程序语言的单词符号的结构，用状态转换图构造了识别单词符号。
The paper describes symbolic structure of word of program language with regular grammar and regular expression, constructs converted-state chart to identify word symbol.
该方法之关键在于直接从时序电路的状态转换图（STD）获得J-K、D和T触发器的激励方程式。
The crux of this method is that excitation equations for J K, D and T flip flops are obtained directly from the state transition diagrams(STDs).
在状态转换图的基础上，构造词形表，为每个状态设计一段处理程序，使词法分析能从字符串中识别单词。
At the base of converted-state chart, building morphology table, designing a section of program for every status, in order to enable lexical analysis to recognize word from character string.
若两状态转换图同构，则两图中的状态均可一一配对为待验证状态对，即所有的代验证状态对均为等价状态对。
If the state transfer graphs are isomorphism, all the states in different graphs can be matched as equal state pairs.
这实际上是一个状态转换图，其中定义了所有有效状态，为了从一个状态转移到下一个状态，必须执行特定的活动。
This is actually a state-transition diagram in which each valid state is well-defined, and a specific activity has to be performed in order to move from one state to the next.
《编译原理》S语言词法分析程序设计方案了解词法分析程序的两种设计方法：1。根据状态转换图直接编程的方式；
" Compiler Principle" S language lexical analysis program design process to understand lexical analysis of two design methods: 1. According to the state transition diagram direct way of programming 2.
不是利用复杂的状态转换图表将一个单一的记录通过多个用户的设置来移动，利用这种方法，您可以简单地创建一个活动设置。
Instead of using complex state transition diagrams to move a single record through multiple sets of users, with this approach you can simply create a set of Activities.
对于在状态转换图中标出的并在struts - config . xml中定义的每个操作，我们需要一个继承org . apache . struts . action . action的实现。
We will need an implementation that extends org.apache.struts.action.Action for each of the actions identified in our state transition diagram and defined in struts-config.xml.
NFA仅仅是一个用于表示实现转换图的状态机的华丽词语。
NFA is simply a fancy word for a state machine that implements the transition diagram.
转换图还包含输入符号（在本例中为XML标记）和控制输入符号如何修改状态的 转换函数。
The transition diagram also includes input symbols (in this case XML tags) and a transition function that controls how input symbols modify the state.
请记住，NFA是一个实现转换图的状态机。
Remember that the NFA is a state machine that implements the transition diagram.
显然在实际情况下，您一定会有比这复杂的转换图，这些转换图有好几个接受状态，您想要识别的每一个XPath都有一个接受状态。
Obviously in a real case, you would have more complex transition diagrams with several accepting states, one for each XPath you want to recognize.
Bill还提到用户体验不像具体的事物那用容易展现，更多的是对时间的掌握，专家通常会使用状态或转换图表来描述用户体验，这也是用户体验中最重要的元素。
User Experience professionals often use state/transistion diagrams to describe the user experience. Bill believes that transitions are the most important element in the UX.
Bill还提到用户体验不像具体的事物那用容易展现，更多的是对时间的掌握，专家通常会使用状态或转换图表来描述用户体验，这也是用户体验中最重要的元素。
User Experience professionals often use state/transistion diagrams to describe the user experience. Bill believes that transitions are the most important element in the UX.
应用推荐