[英]Is the RE and the finite automata same?
我想了解RE a ∗ ba ∗ ab ∗是否与以下有限自动机相同。 我感到困惑的部分是,从状态3到状态4,有ab,这意味着语言的末尾需要有ab,而RE仅具有b *,这意味着0或更大的b。 如果不是,那么此RE的正确有限自动机是什么?
确实,正则表达式a*ba*ab*并不完全与您在问题中所述的原因等同于所示的DFA。
a*ba*ab*
汤普森算法是将正则表达式系统转换为NFA的标准方法。 (如果需要确定性自动机,则可以运行子集构造 。)
[英]Finite Automata
[英]Finite Automata and Regular Expression
[英]Combining deterministic finite automata
[英]Is this by Ardens Lemma? | Finite Automata
[英]Deriving a regular grammar for the language recognised by the Finite Automata
[英]How do these two discrete finite automata differ?
[英]How would I convert regular expression to finite automata?
[英]finding good hash function for languages accepted by finite state automata
[英]Can a Finite Automata exist without any final state?
[英]DFA to RE (Introduction to Automata Theory, Languages and Computation)
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.