Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP
Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modulo cryptographic assumptions . Here we give upper and lower bounds on the approximability of this problem utilizing only the common assumption P ≠ NP, in the setup where the input is a finite language specified by a truth table. To this end, we derive an improved inapproximability result for the biclique edge cover problem. The obtained lower bounds on approximability can be sharpened in the case where the input is given as a deterministic finite automaton over a binary alphabet. This settles most of the open problems stated in . Note that the biclique edge cover problem was recently studied by the authors as lower bound method for the nondeterministic state complexity of finite automata .
Unable to display preview. Download preview PDF.
- 4.Gramlich, G., Schnitger, G.: Minimizing NFA’s and regular expressions. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 399–411. Springer, Heidelberg (2005)Google Scholar
- 6.Gruber, H., Holzer, M.: On the average state and transition complexity of finite languages. Theoretical Computer Science, Special Issue: Selected papers of Descriptional Complexity of Formal Systems, Accepted for publication (2006)Google Scholar
- 7.Gruber, H., Holzer, M.: Computational complexity of NFA minimization for finite and unary languages. In: Proceedings of the 1st International Conference on Language and Automata Theory and Applications, Tarragona, Spain, LNCS, Springer, Heidelberg (accepted for publication, March 2007)Google Scholar
- 12.Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)Google Scholar
- 13.Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 41–110. Springer, Heidelberg (1997)Google Scholar
- 14.Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Report TR05-100, Electronic Colloquium on Computational Complexity (ECCC) (September 2005)Google Scholar