Timeline for Is there an algorithm that can "reverse engineer" a Regular Expression?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 27, 2012 at 18:34 | comment | added | Andrej Bauer | You could do that, but the combinatorial explosion will prevent you from getting very far. It would help to know what your motivation for this question is. | |
| May 27, 2012 at 17:02 | comment | added | Golan | Thanks. I guess the best assumption would be a bound on the number of states. If this is given - say k, one can enumerate over all pairs of such automata (modulo equivalence), and for each pair test a word that separates it. Only one automaton will survive. | |
| May 27, 2012 at 16:57 | vote | accept | Golan | ||
| May 26, 2012 at 6:48 | history | edited | Andrej Bauer | CC BY-SA 3.0 |
added 293 characters in body
|
| May 26, 2012 at 6:42 | history | answered | Andrej Bauer | CC BY-SA 3.0 |