Skip to main content
SpringerLink
Log in

Sublogarithmic Ambiguity

  • Conference paper
Mathematical Foundations of Computer Science 2004 (MFCS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3153))

Abstract

So far the least growth rate known for a divergent inherent ambiguity function was logarithmic. This paper shows that for each computable divergent total non-decreasing function f:ℕ →ℕ there is a context-free language L with a divergent inherent ambiguity function g below f. This proves that extremely slow growing divergent inherent ambiguity functions exist. For instance there is a context-free language L with infinite inherent ambiguity below log*.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling, vol. I. Prentice-Hall, Englewood Cliffs (1972)

    Google Scholar 

  2. Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. Journal of Computer and System Sciences 8, 315–332 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bertoni, A., Choffrut, C., Goldwurm, M., Lonati, V.: On the number of occurrences of a symbol in words of regular languages. Theoretical Computer Science 302, 431–456 (2002)

    Article  MathSciNet  Google Scholar 

  4. Bertoni, A., Goldwurm, M., Santini, M.: Random generation and approximate counting of ambiguously described combinatorial structures. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 567–580. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  5. Crestin, J.: Un langage non ambigu dont le carré est d’ambiguité non bornée. In: Nivat, M. (ed.) Automata, Languages and Programming, pp. 377–390. North-Holland, Amsterdam (1973)

    Google Scholar 

  6. Earley, J.C.: An efficient context-free parsing algorithm. PhD thesis, Carnegie- Mellon University (1968)

    Google Scholar 

  7. Ginsburg, S., Greibach, S.A., Harrison, M.A.: One-way stack automata. Journal of the Association for Computing Machinery 14, 389–418 (1967)

    MATH  MathSciNet  Google Scholar 

  8. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  9. Maurer, H.: The existence of context-free languages which are inherently ambiguous of any degree. Research series, Department of Mathematics, University of Calgary (1968)

    Google Scholar 

  10. Naji, M.: Grad der Mehrdeutigkeit kontextfreier Grammatiken und Sprachen (1998), Diplomarbeit, FB Informatik, Johann–Wolfgang–Goethe–Universität

    Google Scholar 

  11. Ogden, W.: A helpful result for proving inherent ambiguity. Mathematical Systems Theory 2(3), 191–194 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  12. Parikh, R.J.: Language–generating devices. In: Quarterly Progress Report, Research Laboratory of Electronics, M.I.T., vol. 60, pp. 199–212 (1961)

    Google Scholar 

  13. Rossmanith, P., Rytter, W.: Observations on log(n) time parallel recognition of unambiguous cfl’s. Information Processing Letters 44, 267–272 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  14. Shamir, E.: Some inherently ambiguous context-free languages. Information and Control 18, 355–363 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  15. Wich, K.: Exponential ambiguity of context-free grammars. In: Rozenberg, G., Thomas, W. (eds.) Proceedings of the DLT, 1999, pp. 125–138. World Scientific, Singapore (2000)

    Google Scholar 

  16. Wich, K.: Sublinear ambiguity. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 690–698. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  17. Wich, K.: Characterization of context-free languages with polynomially bounded ambiguity. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 703–714. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Wich, K.: Universal inherence of cycle-free context-free ambiguity functions. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 669–680. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für formale Methoden der Informatik, Universität Stuttgart, Universitätsstr. 38, 70569, Stuttgart

    Klaus Wich

Authors
  1. Klaus Wich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic

    Jiří Fiala  & Jan Kratochvíl  & 

  2. Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University, Malostranske nam. 25, 118 00, Praha1, Czech Republic

    Václav Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wich, K. (2004). Sublogarithmic Ambiguity. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds) Mathematical Foundations of Computer Science 2004. MFCS 2004. Lecture Notes in Computer Science, vol 3153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28629-5_62

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28629-5_62

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22823-3

  • Online ISBN: 978-3-540-28629-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation