Expanding on Question 79182
I am sure there must be an active area of research for deriving parameterised patterns.
What I am looking for is something like - given the input
AByyDABxxDMOO
the process returns the expansion rule(s)
⌽f(x)=ABxD
and the expansion
⌽f(yy)⌽f(xx)MOO
Needless to say, what I am looking for handles recursive generation, such as..
ABaAByyDABxxDDMOO => ⌽f(a⌽f(yy)⌽f(xx))MOO
And multiple functions - not just the one as demonstrated here. I recognise that there are multiple correct results - so some sort of optimisation based on non-repetition, and parsimony would be really good.
While I can imagine that genetics and decryption methods may have some sort of approach to this, I do not know where to look - or even how to begin. I know that compression does some of this - but it's based upon positions and works 'from left to right'. I'm looking for something which is more like a grammar derivation.