Re:Regex Puzzle
by eru on Friday July 07, 2017 @11:24AM
(#14719058)
Thanks. I had figured out that grammar induction was the right word to look for a while ago. (But took me a bit to find it.) I know the paper you linked to, but yes, it's not quite the right setup.
[ Parent
| on HN ]
There's a conference on grammar induction called ICGI; might wanna browse through the proceedings to see if there's anything closer.
Thanks!
I'm basically interested in the equivalent of the "guessing game" for regular expressions. (See eg https://stackoverflow.com/questions/5440688/the-guess-the-nu... for a rational number solution.)
With a fixed guesser, that would encode all regular expressions / finite automata as sequences of binary digits. (But in a interestingly different way from just serializing the table for a DFA, or writing down the regular expression in ASCII characters.)