On the hardness of determining small NFA's and of proving lower bounds on their sizes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5257 LNCS, Issue , 2008, Pages 34-55

  Hromkovič, Juraj ^a   Schnitger, Georg ^b  

^a ETH ZURICH   (Switzerland)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC LANGUAGES; AUTOMATA THEORY; CONTEXT FREE LANGUAGES; CONTROL THEORY; FINITE AUTOMATA; FORMAL LANGUAGES; LINGUISTICS; OPTIMIZATION; PIPELINE PROCESSING SYSTEMS; QUERY LANGUAGES; TRANSLATION (LANGUAGES);

COMPUTATIONAL PROBLEMS; DESCRIPTIONAL COMPLEXITIES; DETERMINISTIC FINITE AUTOMATON; EFFICIENT ALGORITHMS; FORMAL DESCRIPTIONS; LOWER BOUNDS; MATHEMATICAL PROOFS; NONDETERMINISTIC FINITE AUTOMATON; REGULAR LANGUAGES;

NANOSTRUCTURED MATERIALS;

EID: 54249086307     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85780-8_3     Document Type: Conference Paper

References (42)

1. Bach, E., Shallit, J.: Algorithmic Number Theory 1. MIT Press, Cambridge (1996)
2. Chrobak, M.: Finite automata and unary languages. Theor. Comput. Sci. 47(3), 149-158 (1986)
3. Geffert, V.: Translation of binary regular expressions into nondeterministic ε-free automata with O(n log n) transitions, J. Comput, Syst. Sci. 66, 451-472 (2003)
4. Gramlich, G.: Probabilistic and nondeterministic unary automata. In: Proc. of 28th MFCS, pp. 460-469 (2003)
5. Gramlich, G., Schnitger, G.: Minimizing nfa's and regular expressions. J. Comput. Syst. Sci. 73, 909-923 (2007)
6. Gruber, H., Holzer, M.: Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP. In: Harju, T., Karhumaki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 205-216. Springer, Heidelberg (2007)
7. Gruber, H., Holzer, M.: Computational complexity of NFA minimization for finite and unary languages. In: Proc. 1st LATA, pp. 261-272 (2007)
8. Hromkovič, J., Karhumäki, J., Klauck, H., Seibert, S., Schnitger, G.: Communication Complexity method for measuring nondeterminism in finite automata. Inf. Comput. 172(2), 202-217 (2002)
9. Hromkovič, J., Schnitger, G.: Comparing the size of NFAs with and without ε-transitions. Theor. Comput. Sci. 380(1-2), 100-114 (2007)
10. Hromkovič, J., Schnitger, G.: On the power of Las Vegas for one-way communication complexity, OBDD's, and finite automata. Information and Computation 169, 284-296 (2001)
11. Hromkovic, J., Schnitger, G.: Communication Complexity and Sequential Computation. In: Príara, I., Ružička, P. (eds.) MFCS 1997. LNCS, vol. 1295, pp. 71-84. Springer, Heidelberg (1997)
12. Hromkovič, J., Seibert, S., Wilke, T.: Translating regular expression into small ε-free nondeterministic automata. J. Comput. Syst. Sci. 62(4), 565-588 (2001)
13. Hromkovič, J.: Communication Complexity and Parallel Computating. Springer, Heidelberg (1997)
14. Hromkovič, J.: Relation Between Chomsky Hierarchy and Communication Complexity Hierarchy. Acta Math. Univ. Com 48-49, 311-317 (1986)
15. Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Comput. 22(6), 1117-1141 (1993)
16. Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)
17. Leung, H.: Separating exponential ambiguous finite automata from polynomially ambiguous finite automata. SIAM J. Comput. 27(4), 1073-1082 (1998)
18. Lifshits, Y.: A lower bound on the size of ε-free NFA corresponding to a regular expression. Inf. Process. Lett. 85(6), 293-299 (2003)
19. Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: Proc. 13th Ann. IEEE Symp. on Switching and Automate Theory, pp. 125-129 (1972)
20. Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2), 231-262 (2004)
21. Papadimitriou, C., Sipser, M.: Communication Complexity. In: Proc. 14th ACM STOC, pp. 196-200 (1982)
22. Pitt, L., Warmuth, M.K.: Prediction-preserving reducibility. J. Comput. Syst. Sci. 41(3), 430-467 (1990)
23. Ravikumar, B., Ibarra, O.H.: Relating the type of ambiguity of finite automata to the succinctness of their presentation. SIAM J. Comput. 18(6), 1263-1282 (1989)
24. Razborov, A.A., Rudich, S.: Natural proofs. J. Comput. Syst. Sci. 55(1), 24-35 (1997)
25. Schnitger, G.: Regular expressions and NFAs without ε transitions. In: Durand, B., Thomas, W. (eds.) STAGS 2006. LNCS, vol. 3884, pp. 432-443. Springer, Heidelberg (2006), www.thi.informatik.uni-frankfurt.de
26. Sippu, S., Soisalon-Soininen, E.: Parsing Theory. Languages and Parsing, vol. I. Springer, Heidelberg (1988)
27. Stearns, R.E., Hunt III, H.B.: On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata. SIAM J. Comput. 14(3), 598-611 (1985)
28. Yao, A.C.: Some Complexity Questions Related to Distributed Computing. In: Proc. 11th ACM STOC, pp. 209-213 (1979)
29. Dietzfelbinger, M., Hromkovič, J., Schnitger, G.: A comparison of two lower bound methods for communication complexity. Theoretical Computer Science 168, 39-51 (1996)
30. Lovász, L.: Communication Complexity. A survey. In: Korte, L., Promel, S. (eds.) Paths, Flows, and VLSI Layout. Springer, Berlin (1990)
31. Hromkovič, J.: Randomized communication protocols (A survey). In: Steinhöfel, K. (ed.) SAGA 2001. LNCS, vol. 2264, pp. 1-32. Springer, Heidelberg (2001)
32. Hromkovič, J.: Communicatoin protocols - an exemplary study of the power of randomness. In: Rajasekharan, S., Pardalos, P.M., Reif, J.H., Rolim, J. (eds.) Handbook of Randomized Computing, vol. II, pp. 533-596
33. Adorna, H.N.: 3-party message complexity is better than 2-party ones for proving lower bounds on the size of minimal nondeterministic finite state automata. In: Proc. 3rd Int. Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, pp. 23-34. Univ. Magdeburg (2001), Preprint No. 16; See also Journal of Automata, Languages and Combinatorics 7 (4), 419-432 (2002)
34. Adorna, H.N.: On the separation between κ-party and (κ + l)-party nondeterministic message complexity. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 152-161. Springer, Heidelberg (2003)
35. Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata,. Information Processing Letters 59, 75-77 (1996)
36. Petersen, H.: personal communication
37. Arnold, A., Dicky, A., Nivat, M.: A note about minimal non-deterministic automata. Bulletin of the EATCS 47, 166-169 (1992)
38. Carrez, C.: On the minimalization of non-deterministic automaton, Laboratoire de Calcul de la Faculté des Sciences de l'Université de Lille (1970)
39. Birget, J.-C.: Partial orders on words, minimal elements of regular languages and state complexity. Theoret. Comput. Sci. 119, 267-291 (1993)
40. Courcelle, B., Niwinski, D., Podelski, A.: A Geometrical View of the Determinization and Minimization of Finite-State Automata. Mathematical Systems Theory 24(2), 117-146 (1991)
41. Gruber, H., Holzer, M.: Finding Lower Bounds for Nondeterministic State Complexity is Hard. Developments in Language Theory 2006, 363-374 (2006)
42. Salomaa, K.: Descriptional Complexity of Nondeterministic Finite Automata. Developments in Lanugage Theory 2007, 31-35 (2007)