简体   繁体   English

这是Ardens Lemma的作品吗? | 有限自动机

[英]Is this by Ardens Lemma? | Finite Automata

I need your help. 我需要你的帮助。 When I get this question like this 当我收到这样的问题时 在此处输入图片说明

and when I see the answer it look like this 当我看到答案时,它看起来像这样

在此处输入图片说明

This must be by Ardens Lemma right? 这一定是Ardens Lemma的作品吧? I just want to why teacher eliminated first E1 then E2, why not E2 then E1? 我只想为什么老师先消除E1然后消除E2,为什么不消除E2然后消除E1?

Second Question: I want to know do I have to first convert NFA to DFA then do by Ardens Lemma? 第二个问题:我想知道是否必须先将NFA转换为DFA,然后由Ardens Lemma进行?

Question 1: Probably because $E_1$ does not appear on the right hand side of its own equation. 问题1:可能是因为$ E_1 $不在其等式的右侧出现。 Otherwise you could not eliminate it so easily, becuase replacing it by the right hand side would just lead to new occurences. 否则,您将无法轻松消除它,因为用右手替换它会导致新的情况。

Question 2: Arden's rule applies to equations of sets. 问题2: Arden的规则适用于集合方程。 It does not matter which kind of automaton these equations are derived from. 这些方程式衍生自哪种自动机都没关系。 But from a deterministic one you get easier equations. 但是从确定性方程式中,您可以获得更简单的方程式。

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM