Skip to main content
SpringerLink
Log in
Book cover

Results and Trends in Theoretical Computer Science pp 232–250Cite as

On the multiplicity equivalence problem for context-free grammars

  • Chapter
  • First Online:

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

Abstract

Two context-free grammars are called multiplicity equivalent iff all words over the common terminal alphabet are generated with the same degree of ambiguity. Generalizing a technique introduced by D. Raz, we show for some classes of context-free grammars that their multiplicity equivalence problem is decidable.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Andrasiu, J. Dassow, Gh. Paun, A. Salomaa: Language-theoretic problems arising from Richelieu cryptosystems. Theoretical Computer Science 116 (1993), 339–357.

    Google Scholar 

  2. S. Ginsburg: The Mathematical Theory of Context-Free Languages. McGraw-Hill, 1966.

    Google Scholar 

  3. T. Harju, J. Karhumäki: The equivalence problem of multitape finite automata. Theoretical Computer Science 78 (1991), 347–355.

    Google Scholar 

  4. W. Kuich, A. Salomaa: Semirings, Automata, Languages. Springer, 1986.

    Google Scholar 

  5. Gh. Paun, A. Salomaa: Thin and slender languages. To appear in: Discrete Applied Mathematics.

    Google Scholar 

  6. Gh. Paun, A. Salomaa: Closure properties of slender languages. Theoretical Computer Science 120 (1993), 293–301.

    Google Scholar 

  7. Gh. Paun, A. Salomaa: Decision problems concerning the thinness of DOL languages. Bulletin of the EATCS 46 (1992), 171–181.

    Google Scholar 

  8. D. Raz: Deciding multiplicity equivalence of certain context-free languages. Manuscript (1993), first version.

    Google Scholar 

  9. D. Raz: Deciding multiplicity equivalence of certain context-free languages. Manuscript (1993), second version, to appear in Proceedings of the Conference on Developments in Language Theory (G. Rozenberg, A. Salomaa eds.), World Scientific Publ. Co., 1994.

    Google Scholar 

  10. A. Salomaa: Formal Languages. Academic Press, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Algebra und Diskrete Mathematik, Technische Universität Wien, Wiedner Hauptstraße 8-10, A-1040, Wien

    Werner Kuich

Authors
  1. Werner Kuich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Juliani Karhumäki Hermann Maurer Grzegorz Rozenberg

Additional information

Meinem Freund Arto zum 60. Geburtstag gewidmet.

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kuich, W. (1994). On the multiplicity equivalence problem for context-free grammars. In: Karhumäki, J., Maurer, H., Rozenberg, G. (eds) Results and Trends in Theoretical Computer Science. Lecture Notes in Computer Science, vol 812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58131-6_50

Download citation

  • DOI: https://doi.org/10.1007/3-540-58131-6_50

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58131-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation