[英]How to understand DFA (Finite Automata)?
Indicate the state that the DFA will end in after processing each of the following input strings. 指示在处理以下每个输入字符串之后DFA将以何种状态结束。 Note: the input labeled "The empty string" is literally the empty string—a string with no letters in it—not the letters 'T', 'h', 'e', ' ', 'e', and so forth. 注意:标记为“空字符串”的输入实际上是空字符串,即其中没有字母的字符串,而不是字母“ T”,“ h”,“ e”,“,”,“ e”等。
For the string = abcba, do I end in state 2? 对于字符串= abcba,我是否以状态2结尾?
Also, what is that double circle means? 另外,那个双圈是什么意思?
Yes, after abcba, you end in state 2. 是的,在abcba之后,您进入状态2。
The double-circle usually indicates an accepting state -- in the DFA for a regular expression, the string you've received so far matches the regular expression iff you're in an accepting state. 双圆圈通常表示接受状态-在DFA中,对于正则表达式,到目前为止,您收到的字符串与正则表达式(如果您处于接受状态)匹配。
If a regular expression matches the empty string then the start state will also be an accepting state, as is the case here. 如果正则表达式匹配空字符串,则开始状态也将是接受状态,如此处所示。
Good Evening ! 晚上好 ! yes after reading 是的,看完之后
abcba
you wil reach on (2) state.. 您将达到(2)状态。
double circle shows the Final State . 双圈显示最终状态。 ie shows acceptance of string the Destination 即表明接受字符串的目的地
empty string or Lemda is accepted from a DFA it means that initial and final state is same for that DFA (language) DFA接受了空字符串或Lemda,这表示该DFA(语言)的初始状态和最终状态相同
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.