Skip to main content
SpringerLink
Log in
Book cover

Colloquium on Trees in Algebra and Programming

CAAP 1986: CAAP '86 pp 85–99Cite as

Membership for growing context sensitive grammars is polynomial

  • Graphs And Grammars
  • Conference paper
  • First Online:

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

Abstract

The membership problem for fixed context-sensitive languages is polynomial if the right hand side of every production is strictly longer than the left hand side.

This research was done while the authors were visiting the Hebrew University of Jerusalem. The first author was supported by the Minerva Foundation and the second author by the United States-Israel Binational Foundation, grant no. 2439-82.

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. Y. M. Bar-Hillel, M. Perles, and E. Shamir, "On Formal Properties of Simple Phase Structure Grammars," Z. Phonetik Sprachwiss. Kommunikationsforschung, Vol. 14, pp. 143–172 (1961).

    Google Scholar 

  2. R. V. Book, "Time Bounded Grammars and their Languages," Journal of Computer and Systems Sciences, Vol. 5, pp. 397–429 (1971).

    Google Scholar 

  3. R. V. Book, "On the Structure of Context-Sensitive Grammar," International Journal of Computer and Information Sciences, Vol. 2, No. 2, pp. 129–139 (1973).

    Google Scholar 

  4. R. V. Book, "On the Complexity of Formal Grammars," Acta Informatica, Vol. 9, pp. 171–182 (1978).

    Google Scholar 

  5. N. Chomsky, "A Note on Phase-Structure Grammars," Information and Control, Vol. 2, pp. 137–167 (1959).

    Google Scholar 

  6. S. A. Cook, "Path Systems and Language Recognition," Proc. Second Annual ACM Symposium on Theory of Computing, pp. 70–72 (1970).

    Google Scholar 

  7. A. Gladkii, "On the Complexity of Derivations in Phase-Structure Grammars," (in Russian), Algebri i Logika, Sem. 3, Nr. 5–6, pp.29–44 (1964).

    Google Scholar 

  8. J. Gonczarowski and E. Shamir, "Pattern Selector Grammars and Several Parsing Algorithms in the Context-Free Style," Journal of Computer and System Sciences, Vol. 30, No. 3, pp. 249–273 (1985).

    Google Scholar 

  9. J. Gonczarowski and M. K. Warmuth, "Applications of Scheduling Theory to Formal Language Theory," Fundamental Studies Issue of Theoretical Computer Science, Vol. 37, No. 2, pp. 217–243 (1985).

    Google Scholar 

  10. J. Gonczarowski and M. K. Warmuth, "Manipulating Derivation Forests by Scheduling Techniques," Technical Report 85-3, Department of Computer Science, Hebrew University of Jerusalem.

    Google Scholar 

  11. J. Gonczarowski and M. K. Warmuth, "On the Complexity of Scattered Grammars," in preparation.

    Google Scholar 

  12. S. Greibach and J. Hopcraft, "Scattered Context Grammars," Journal of Computer and Systems Sciences, Vol. 3, pp. 233–249 (1969).

    Google Scholar 

  13. M. A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, Mass. (1978).

    Google Scholar 

  14. R. M. Karp, "Reducibility among Combinatorial Problems," in: R. E. Miller and J. W. Thatcher (eds.) Complexity of Computer Computations, Plenum Press, pp. 85–103, New York (1972).

    Google Scholar 

  15. S. Y. Kuroda, "Classes of Languages and Linear Bounded Automata," Information and Control, Vol. 7, pp. 207–223 (1964).

    Google Scholar 

  16. J. Loeckx, "The Parsing of General Phase-Structure Grammars," Information and Control, Vol. 16, pp. 443–464 (1970).

    Google Scholar 

  17. W. L. Ruzzo, "Tree-Size Bounded Alternation," Journal of Computer and System Sciences, Vol. 21, pp. 218–235 (1980).

    Google Scholar 

  18. A. Salomaa, Formal Languages, Academic Press, N.Y. (1973).

    Google Scholar 

  19. P. M. Lewis, R. E. Stearns and J. Hartmanis, "Memory Bounds for Recognition of Context-Free and Context-Sensitive Languages," Proc. Sixth Annual IEEE Symposium Switching Circuit Theory and Logical Design, pp. 191–212 (1965).

    Google Scholar 

  20. H. Sudborough, "On the Tape Complexity of Deterministic Context-Free Languages," Journal of the ACM, Vol. 25, pp. 405–414 (1978).

    Google Scholar 

  21. J. D. Ullman and A. V. Gelder, "Parallel Complexity of Logical Query Programs," Technical Report, Department of Computer Science, Stanford University (1985).

    Google Scholar 

  22. D. H. Younger, "Recognition and Parsing of Context-Free Languages in Time n3," Information and Control, Vol. 10, pp. 189–208 (1967).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik, Technische Universität Berlin, Strasse des 17. Juni 135, 1000, Berlin - West 12, Germany

    Elias Dahlhaus

  2. Department of Computer and Information Sciences 237 Applied Sciences, University of California, 95064, Santa Cruz, CA, USA

    Manfred K. Warmuth

Authors
  1. Elias Dahlhaus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manfred K. Warmuth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paul Franchi-Zannettacci

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Dahlhaus, E., Warmuth, M.K. (1986). Membership for growing context sensitive grammars is polynomial. In: Franchi-Zannettacci, P. (eds) CAAP '86. CAAP 1986. Lecture Notes in Computer Science, vol 214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022661

Download citation

  • DOI: https://doi.org/10.1007/BFb0022661

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39783-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation