在不使用 DFA 的情况下证明自动机理论中的两个正则表达式是等价的 [英]Show that two regular expressions are equivalent in Automata Theory without using DFAs
形式语言理论(正则表达式和正则语言)-“或”的概念 [英]Formal language theory (regular expressions and regular languages) - concept of “OR”
DFA 到 RE 的转换但是如果 init 和 final state 相同怎么办? [英]DFA to RE conversion but what if init and final state same?
如何使用 Arden 定理获得此 DFA 的 RE? 无法获得所需的正则表达式 [英]How to get RE for this DFA Using Arden's Theorem? Unable to get desired Regular expression