# Tag Info

### How does a minimal DFA ensure minimal computational cost?

As Yuval commented, I also think you're taking Wikipedia too literally. The way I interpreted that sentence is as follows. Decision procedures about deterministic automata are easier compared to ...
• 3,827

### Using SMT solvers to parse regular academic expressions

I am not sure what you mean by using SMT Solvers. However, the things you mentioned can be implemented using the standard lexing and parsing libraries. I used PLY once to lex and parse regular ...
• 46

### How to prove (L+M)* = M*.(L.M*)*

I am not sure if $(L.M^*)^*$ can be simplified further, I don't think it can be. I am not sure how you are suggesting to prove this based on the fact that $(L+M)^* = M^*.(L.M^*)^*$. Though this is a ...
• 46

### Converting DFA to Regular Expression Using State Removal

I assume you are trying to convert the automaton to a regular expression by creating an equivalent GNFA, and are understanding how GNFAs work. Here's my attempt at converting to a regular expression: ...
• 13
As far as I can tell, you are asking about constructing an $\epsilon$-NFA $B$ from a DFA $A$; such that $L(B) = L(A)^*$. If yes, please edit the question, and write it more clearly. Well, your ...