Is finding the minimum regular expression an NP-complete problem? Posted by László Kozma, at cstheory.stackexchange.com, 01 Oct 2010 I am thinking of the following problem: I want to find a regular expression that matches a particular set of strings (for ex.