Skip to main content
SpringerLink
Log in

Universal Inherence of Cycle-Free Context-Free Ambiguity Functions

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2002)

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

Included in the following conference series:

Abstract

It is shown that the set of inherent ambiguity functions for context-free languages and the set of ambiguity functions for cycle-free context-free grammars coincide. Moreover for each census function γ of an unambiguous context-free language the least monotone function larger than or equal to γ is an inherent ambiguity function. Both results are based on a more general theorem. Informally it states that the loss of information induced by a length preserving homomorphism on an unambiguous context-free language can be turned into inherent ambiguity.

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. J. Berstel. Transductions and context-free languages. Teubner Studienbücher, Stuttgart, 1979.

    MATH  Google Scholar 

  2. J. Crestin. Un langage non ambigu dont le carré est d’ambiguité non bornée. In M. Nivat, editor, Automata, Languages and Programming, pages 377–390. Amsterdam, North-Holland, 1973.

    Google Scholar 

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

    Google Scholar 

  4. M. Naji. Grad der Mehrdeutigkeit kontextfreier Grammatiken und Sprachen, 1998. Diplomarbeit, FB Informatik, Johann-Wolfgang-Goethe-Universität Frankfurt/M.

    Google Scholar 

  5. R. J. Parikh. Language-generating devices. In Quarterly Progress Report, volume 60, pages 199–212. Research Laboratory of Electronics, M.I.T, 1961.

    Google Scholar 

  6. K. Wich. Exponential ambiguity of context-free grammars. In G. Rozenberg and W. Thomas, editors, Proceedings of the 4th International Conference on Developments in Language Theory, July 1999, pages 125–138. World Scientific, Singapore, 2000.

    Google Scholar 

  7. K. Wich. Sublinear ambiguity. In M. Nielsen and B. Rovan, editors, Proceedings of the MFCS 2000, number 1893 in Lecture Notes in Computer Science, pages 690–698, Berlin-Heidelberg-New York, 2000. Springer.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Stuttgart, Breitwiesenstr. 20-22, 70565, 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 of Theoretical Computer Science, ETH Zentrum, ETH Zürich, 8092, Zürich, Switzerland

    Peter Widmayer  & Stephan Eidenbenz  & 

  2. Department of Languages and Sciences of the Computation E.T.S. de Ingeniería Informática, University of Málaga, Campus de Teatinos, 29071, Málaga, Spain

    Francisco Triguero , Rafael Morales  & Ricardo Conejo ,  & 

  3. School of Cognitive and Computing Sciences, University of Sussex, Falmer, Brighton, BN1 9QN, UK

    Matthew Hennessy

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wich, K. (2002). Universal Inherence of Cycle-Free Context-Free Ambiguity Functions. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_57

Download citation

  • DOI: https://doi.org/10.1007/3-540-45465-9_57

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43864-9

  • Online ISBN: 978-3-540-45465-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation