Theory of Computation2080.15 marksNumerical: Arden's theorem DFA conversionConversion of DFA to Regular Expression
State Arden's theorem. Convert following DFA into its regular expression using Arden theorem. | | 0 | 1 | |---|---|---| | rightarrow *Q1 | Q1 | Q2 | | Q2 | Q3 | Q2 | | Q3 | Q1 | Q2 |
State Arden's theorem. Convert following DFA into its regular expression using Arden theorem.
| 0 | 1 | |
|---|---|---|
| $\rightarrow *Q1$ | $Q1$ | $Q2$ |
| $Q2$ | $Q3$ | $Q2$ |
| $Q3$ | $Q1$ | $Q2$ |
[5]
Transition table: State 0 1 ------------- →Q1 Q1 Q2 Q2 Q3 Q2 Q3 Q1 Q2 - Start state: Q1 - Final state: Q1 If $P$ and $Q$ are regular expressions over $\Sigma$, and $P$ does not contain $\varepsilon$, then the equation $$R = Q + RP$$ has the unique solution $$R = QP^$$ Incoming transitions: - Into...