Minimizing nfa's and regular expressions

We show inapproximability results concerning minimization of nondeterministic finite automata (nfa's) as well as of regular expressions relative to given nfa's, regular expressions or deterministic finite automata (dfa's). We show that it is impossible to efficiently minimize a given nfa or regular expression with n states, transitions, respectively symbols within the factor o(n), unless P=PSPACE. For the unary case, we show that for any @d>0 it is impossible to efficiently construct an approximately minimal nfa or regular expression within the factor n^1^-^@d, unless P=NP. Our inapproximability results for a given dfa with n states are based on cryptographic assumptions and we show that any efficient algorithm will have an approximation factor of at least npoly(logn). Our setup also allows us to analyze the minimum consistent dfa problem.

[1]  Moni Naor,et al.  Number-theoretic constructions of efficient pseudo-random functions , 2004, JACM.

[2]  Lucian Ilie,et al.  Follow automata , 2003, Inf. Comput..

[3]  Leonard Pitt,et al.  Prediction-Preserving Reducibility , 1990, J. Comput. Syst. Sci..

[4]  Alexander A. Razborov,et al.  Natural Proofs , 2007 .

[5]  Gregor Gramlich.  Probabilistic and Nondeterministic Unary Automata , 2003, MFCS.

[6]  Tao Jiang,et al.  The Structure and Complexity of Minimal NFA's over a Unary Alphabet , 1991, FSTTCS.

[7]  Anna Philippou,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

[8]  Leonard Pitt,et al.  The minimum consistent DFA problem cannot be approximated within any polynomial , 1993, JACM.

[9]  Jean-Marc Champarnaud,et al.  NFA reduction algorithms by means of regular inequalities , 2004, Theor. Comput. Sci..

[10]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[11]  Lucian Ilie,et al.  On NFA Reductions , 2004, Theory Is Forever.

[12]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[13]  Leslie G. Valiant,et al.  Cryptographic Limitations on Learning Boolean Formulae and Finite Automata , 1993, Machine Learning: From Theory to Applications.

[14]  Tao Jiang,et al.  Minimal NFA Problems are Hard , 1991, SIAM J. Comput..

[15]  Jeffrey Shallit,et al.  On the Number of Distinct Languages Accepted by Finite Automata with n States , 2002, DCFS.

[16]  Georg Schnitger,et al.  Minimizing NFA's and Regular Expressions , 2005, STACS.