Somehow this challenge reminds me of finding a minimal normal form for a Boolean function.
There are algorithms for this task, e.g. Quine McCluskey algorithm or Petrick's method.
Though this challenge does not deal with a Boolean algebra, the ideas therein might give some inspiration.
Just a thought.
Greetings,
-jo
In reply to Re: Challenge: Generate a glob patterns from a word list
by jo37
in thread Challenge: Generate a glob patterns from a word list
by choroba
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |