找到匹配所有给定字符串的最简单正则表达式

Is there an algorithm that can produce a regular expression (maybe limited to a simplified grammar) from a set of strings such that the evaluation of all possible strings that match the regular expression reproduces the initial set of strings?Is there an algorithm that can produce a regula