Skip to main content
SpringerLink
Log in

On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes

  • Conference paper
Developments in Language Theory (DLT 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5257))

Included in the following conference series:

  • 712 Accesses

Abstract

In contrast to the minimization of deterministic finite automata (DFA’s), the task of constructing a minimal nondeterministic finite automaton (NFA) for a given NFA is PSPACE-complete. This fact motivates the following computational problems:

(i) Find a minimal NFA for a regular language L, if L is given by another suitable formal description, resp. come up with a small NFA.

(ii) Estimate the size of minimal NFA’s or find at least a good approximation of their sizes.

Here, we survey the known results striving to solve the problems formulated above and show that also for restricted versions of minimization of NFA’s there are no efficient algorithms.

Since one is unable to efficiently estimate the size of a minimal NFA in an algorithmic way, one can ask at least for developing mathematical proof methods that help in proving good lower bounds on the size of a minimal NFA for a given regular language. We show here that even the best known methods for this purpose fail for some concrete regular languages.

Finally, we give an overview of the results about the influence of the degree of ambiguity on the size of NFA’s and discuss the relation between the descriptional complexity of NFA’s and NFA’s with ε-transitions.

The work on this paper was supported by SNF-grant 200023-007327/1, DFG-grant SCHN 503/4-1 and was done during the stay of the second author at ETH Zurich.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bach, E., Shallit, J.: Algorithmic Number Theory 1. MIT Press, Cambridge (1996)

    MATH  Google Scholar 

  2. Chrobak, M.: Finite automata and unary languages. Theor. Comput. Sci. 47(3), 149–158 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  3. Geffert, V.: Translation of binary regular expressions into nondeterministic ε-free automata with O(n logn) transitions. J. Comput. Syst. Sci. 66, 451–472 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Gramlich, G.: Probabilistic and nondeterministic unary automata. In: Proc. of 28th MFCS, pp. 460–469 (2003)

    Google Scholar 

  5. Gramlich, G., Schnitger, G.: Minimizing nfa’s and regular expressions. J. Comput. Syst. Sci. 73, 909–923 (2007)

    MathSciNet  Google Scholar 

  6. Gruber, H., Holzer, M.: Inapproximability of nondeterministic state and transition complexity assuming P \(\not=\) NP. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 205–216. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Gruber, H., Holzer, M.: Computational complexity of NFA minimization for finite and unary languages. In: Proc. 1st LATA, pp. 261–272 (2007)

    Google Scholar 

  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)

    Article  MATH  Google Scholar 

  9. Hromkovič, J., Schnitger, G.: Comparing the size of NFAs with and without ε-transitions. Theor. Comput. Sci. 380(1-2), 100–114 (2007)

    Article  MATH  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hromkovič, 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)

    Chapter  Google Scholar 

  12. Hromkovič, J., Seibert, S., Wilke, T.: Translating regular expression into small ε-free nondeterministic automata. J. Comput. Syst. Sci. 62(4), 565–588 (2001)

    Article  MATH  Google Scholar 

  13. Hromkovič, J.: Communication Complexity and Parallel Computating. Springer, Heidelberg (1997)

    Google Scholar 

  14. Hromkovič, J.: Relation Between Chomsky Hierarchy and Communication Complexity Hierarchy. Acta Math. Univ. Com 48-49, 311–317 (1986)

    Google Scholar 

  15. Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Comput. 22(6), 1117–1141 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  16. Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)

    MATH  Google Scholar 

  17. Leung, H.: Separating exponential ambiguous finite automata from polynomially ambiguous finite automata. SIAM J. Comput. 27(4), 1073–1082 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Google Scholar 

  20. Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2), 231–262 (2004)

    Article  MathSciNet  Google Scholar 

  21. Papadimitriou, C., Sipser, M.: Communication Complexity. In: Proc. 14th ACM STOC, pp. 196–200 (1982)

    Google Scholar 

  22. Pitt, L., Warmuth, M.K.: Prediction-preserving reducibility. J. Comput. Syst. Sci. 41(3), 430–467 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  24. Razborov, A.A., Rudich, S.: Natural proofs. J. Comput. Syst. Sci. 55(1), 24–35 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  25. Schnitger, G.: Regular expressions and NFAs without ε transitions. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 432–443. Springer, Heidelberg (2006), www.thi.informatik.uni-frankfurt.de

    Chapter  Google Scholar 

  26. Sippu, S., Soisalon-Soininen, E.: Parsing Theory. Languages and Parsing, vol. I. Springer, Heidelberg (1988)

    MATH  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  28. Yao, A.C.: Some Complexity Questions Related to Distributed Computing. In: Proc. 11th ACM STOC, pp. 209–213 (1979)

    Google Scholar 

  29. Dietzfelbinger, M., Hromkovič, J., Schnitger, G.: A comparison of two lower bound methods for communication complexity. Theoretical Computer Science 168, 39–51 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  30. Lovász, L.: Communication Complexity. A survey. In: Korte, L., Promel, S. (eds.) Paths, Flows, and VLSI Layout. Springer, Berlin (1990)

    Google Scholar 

  31. Hromkovič, J.: Randomized communication protocols (A survey). In: Steinhöfel, K. (ed.) SAGA 2001. LNCS, vol. 2264, pp. 1–32. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  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

    Google Scholar 

  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)

    Google Scholar 

  34. Adorna, H.N.: On the separation between k-party and (k + 1)-party nondeterministic message complexity. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 152–161. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  35. Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Information Processing Letters 59, 75–77 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  36. Petersen, H.: personal communication

    Google Scholar 

  37. Arnold, A., Dicky, A., Nivat, M.: A note about minimal non-deterministic automata. Bulletin of the EATCS 47, 166–169 (1992)

    MATH  Google Scholar 

  38. Carrez, C.: On the minimalization of non-deterministic automaton, Laboratoire de Calcul de la Faculté des Sciences de l’Université de Lille (1970)

    Google Scholar 

  39. Birget, J.-C.: Partial orders on words, minimal elements of regular languages and state complexity. Theoret. Comput. Sci. 119, 267–291 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  41. Gruber, H., Holzer, M.: Finding Lower Bounds for Nondeterministic State Complexity is Hard. Developments in Language Theory 2006, 363–374 (2006)

    Google Scholar 

  42. Salomaa, K.: Descriptional Complexity of Nondeterministic Finite Automata. Developments in Lanugage Theory 2007, 31–35 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, ETH Zurich, ETH Zentrum, CH-8022, Zurich, Switzerland

    Juraj Hromkovič

  2. Department of Computer Science, Johann-Wolfgang-Goethe Universität, Robert Mayer-Strasse 11-15, D-6054, Frankfurt a. M., Germany

    Georg Schnitger

Authors
  1. Juraj Hromkovič
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Georg Schnitger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Masami Ito Masafumi Toyama

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hromkovič, J., Schnitger, G. (2008). On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2008. Lecture Notes in Computer Science, vol 5257. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85780-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85780-8_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85779-2

  • Online ISBN: 978-3-540-85780-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation